java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:49:05,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:49:05,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:49:05,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:49:05,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:49:05,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:49:05,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:49:05,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:49:05,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:49:05,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:49:05,307 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:49:05,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:49:05,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:49:05,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:49:05,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:49:05,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:49:05,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:49:05,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:49:05,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:49:05,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:49:05,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:49:05,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:49:05,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:49:05,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:49:05,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:49:05,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:49:05,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:49:05,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:49:05,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:49:05,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:49:05,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:49:05,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:49:05,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:49:05,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:49:05,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:49:05,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:49:05,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:49:05,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:49:05,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:49:05,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:49:05,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:49:05,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:49:05,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:49:05,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:49:05,400 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:49:05,401 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:49:05,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:49:05,402 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:49:05,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:49:05,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:49:05,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:05,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:49:05,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:49:05,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:05,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:49:05,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:49:05,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:49:05,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/1) ... [2019-08-05 10:49:05,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:49:05,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:49:05,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:49:05,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:49:05,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (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:49:05,555 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:49:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:49:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:49:05,824 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:49:05,824 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:49:05,825 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:05 BoogieIcfgContainer [2019-08-05 10:49:05,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:49:05,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:49:05,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:49:05,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:49:05,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:05" (1/2) ... [2019-08-05 10:49:05,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa8d3aa and model type count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:49:05, skipping insertion in model container [2019-08-05 10:49:05,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:05" (2/2) ... [2019-08-05 10:49:05,840 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:49:05,848 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:49:05,855 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:49:05,870 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:49:05,903 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:49:05,904 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:49:05,904 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:49:05,904 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:49:05,905 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:49:05,905 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:49:05,905 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:49:05,906 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:49:05,906 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:49:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:49:05,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:49:05,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:49:05,931 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-08-05 10:49:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,069 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:49:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:06,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:49:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:49:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:06,089 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:49:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,126 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:49:06,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:49:06,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:49:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,140 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:49:06,140 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:49:06,144 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:49:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:49:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:49:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:49:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:49:06,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:49:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,173 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:49:06,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:49:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:49:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:49:06,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:49:06,175 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-08-05 10:49:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:49:06,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:06,346 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:49:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,433 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:49:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:06,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:49:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,434 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:49:06,435 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:49:06,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:49:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:49:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:49:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:49:06,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:49:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,440 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:49:06,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:49:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:06,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,444 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:49:06,444 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2019-08-05 10:49:06,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:49:06,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:49:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:49:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:06,581 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:49:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,649 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:49:06,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:49:06,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:49:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,650 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:49:06,650 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:49:06,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:49:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:49:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:49:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:49:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:49:06,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:49:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,653 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:49:06,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:49:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:49:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:49:06,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,654 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:49:06,655 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2019-08-05 10:49:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:49:06,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:49:06,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:49:06,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:06,792 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:49:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,843 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:49:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:49:06,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:49:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,844 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:49:06,844 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:49:06,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:49:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:49:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:49:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:49:06,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:49:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,847 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:49:06,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:49:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:49:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:49:06,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,848 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:49:06,848 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2019-08-05 10:49:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:49:07,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:49:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:49:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:07,031 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:49:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,065 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:49:07,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:49:07,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:49:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,067 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:49:07,067 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:49:07,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:49:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:49:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:49:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:49:07,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:49:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,070 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:49:07,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:49:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:49:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:49:07,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,071 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:49:07,071 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2019-08-05 10:49:07,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:49:07,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:49:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:49:07,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:07,400 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:49:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,490 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:49:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:49:07,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:49:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,498 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:49:07,498 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:49:07,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:49:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:49:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:49:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:49:07,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:49:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,502 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:49:07,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:49:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:49:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:49:07,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,504 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:49:07,506 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2019-08-05 10:49:07,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:49:07,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:49:07,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:49:07,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:07,760 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:49:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,785 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:49:07,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:49:07,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:49:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,788 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:49:07,788 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:49:07,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:49:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:49:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:49:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:49:07,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:49:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,792 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:49:07,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:49:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:49:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:49:07,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,792 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:49:07,793 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2019-08-05 10:49:07,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:49:07,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:49:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:49:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:07,964 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:49:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,001 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:49:08,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:49:08,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:49:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,003 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:49:08,003 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:49:08,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:49:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:49:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:49:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:49:08,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:49:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,007 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:49:08,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:49:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:49:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:49:08,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,008 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:49:08,008 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2019-08-05 10:49:08,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:49:08,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:49:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:49:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:08,473 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:49:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,514 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:49:08,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:49:08,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:49:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,515 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:49:08,515 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:49:08,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:49:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:49:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:49:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:49:08,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:49:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,519 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:49:08,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:49:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:49:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:49:08,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,520 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:49:08,520 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2019-08-05 10:49:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:49:08,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:49:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:49:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:49:08,752 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:49:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,780 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:49:08,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:49:08,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:49:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,782 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:49:08,782 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:49:08,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:49:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:49:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:49:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:49:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:49:08,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:49:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,786 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:49:08,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:49:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:49:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:49:08,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,787 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:49:08,787 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2019-08-05 10:49:08,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:49:09,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:49:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:49:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:49:09,005 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:49:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,033 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:49:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:49:09,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:49:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,034 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:49:09,035 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:49:09,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:49:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:49:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:49:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:49:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:49:09,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:49:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,039 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:49:09,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:49:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:49:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:49:09,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,040 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:49:09,040 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2019-08-05 10:49:09,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:49:09,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:49:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:49:09,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:09,348 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:49:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,393 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:49:09,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:49:09,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:49:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,395 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:49:09,395 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:49:09,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:49:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:49:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:49:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:49:09,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:49:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,398 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:49:09,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:49:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:49:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:49:09,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,399 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:49:09,399 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2019-08-05 10:49:09,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:49:09,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:49:09,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:49:09,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:09,651 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:49:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,675 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:49:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:49:09,676 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:49:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,677 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:49:09,677 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:49:09,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:49:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:49:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:49:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:49:09,681 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:49:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,681 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:49:09,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:49:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:49:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:49:09,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,682 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:49:09,682 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,682 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2019-08-05 10:49:09,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:49:09,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:49:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:49:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:49:09,987 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:49:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,010 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:49:10,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:49:10,011 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:49:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,012 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:49:10,012 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:49:10,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:49:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:49:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:49:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:49:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:49:10,016 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:49:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,016 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:49:10,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:49:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:49:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:49:10,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,018 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:49:10,019 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2019-08-05 10:49:10,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:10,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:49:10,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:49:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:49:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:10,261 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:49:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,389 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:49:10,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:49:10,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:49:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,391 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:49:10,391 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:49:10,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:49:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:49:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:49:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:49:10,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:49:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,397 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:49:10,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:49:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:49:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:49:10,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,398 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:49:10,398 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2019-08-05 10:49:10,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:10,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:49:10,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:49:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:49:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:10,758 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:49:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,051 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:49:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:49:11,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:49:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,053 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:49:11,053 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:49:11,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:49:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:49:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:49:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:49:11,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:49:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,056 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:49:11,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:49:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:49:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:49:11,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,057 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:49:11,057 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2019-08-05 10:49:11,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:11,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:11,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:49:11,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:49:11,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:49:11,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:49:11,471 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:49:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,517 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:49:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:49:11,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:49:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,519 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:49:11,519 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:49:11,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 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:49:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:49:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:49:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:49:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:49:11,522 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:49:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,522 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:49:11,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:49:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:49:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:49:11,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,523 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:49:11,524 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2019-08-05 10:49:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:12,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:12,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:49:12,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:49:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:49:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:12,385 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:49:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:12,421 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:49:12,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:49:12,424 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:49:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:12,425 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:49:12,425 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:49:12,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:49:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:49:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:49:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:49:12,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:49:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:12,428 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:49:12,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:49:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:49:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:49:12,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:12,430 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:49:12,431 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2019-08-05 10:49:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:12,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:49:12,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:12,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:12,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:49:12,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:49:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:49:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:49:12,941 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:49:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:12,977 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:49:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:49:12,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:49:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:12,978 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:49:12,978 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:49:12,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:49:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:49:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:49:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:49:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:49:12,983 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:49:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:12,983 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:49:12,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:49:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:49:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:49:12,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:12,984 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:49:12,984 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2019-08-05 10:49:12,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:13,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:49:13,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:49:13,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:49:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:13,303 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:49:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:13,332 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:49:13,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:49:13,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:49:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:13,333 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:49:13,333 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:49:13,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:49:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:49:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:49:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:49:13,338 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:49:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:13,338 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:49:13,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:49:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:49:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:49:13,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:13,339 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:49:13,339 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2019-08-05 10:49:13,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:13,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:49:13,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:49:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:49:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:13,716 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:49:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:13,747 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:49:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:49:13,748 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:49:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:13,749 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:49:13,749 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:49:13,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:49:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:49:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:49:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:49:13,752 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:49:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:13,752 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:49:13,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:49:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:49:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:49:13,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:13,753 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:49:13,754 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2019-08-05 10:49:13,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:14,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:49:14,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:49:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:49:14,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:14,135 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:49:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,221 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:49:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:49:14,224 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:49:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,225 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:49:14,225 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:49:14,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:49:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:49:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:49:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:49:14,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:49:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,228 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:49:14,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:49:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:49:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:49:14,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,229 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:49:14,230 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2019-08-05 10:49:14,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:14,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:49:14,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:49:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:49:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:14,670 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:49:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,706 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:49:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:49:14,706 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:49:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,707 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:49:14,707 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:49:14,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:49:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:49:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:49:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:49:14,711 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:49:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,712 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:49:14,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:49:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:49:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:49:14,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,713 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:49:14,713 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2019-08-05 10:49:14,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:15,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:15,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:49:15,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:49:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:49:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:15,853 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:49:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:15,946 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:49:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:49:15,948 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:49:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:15,948 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:49:15,948 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:49:15,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:49:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:49:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:49:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:49:15,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:49:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,953 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:49:15,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:49:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:49:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:49:15,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,955 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:49:15,955 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2019-08-05 10:49:15,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:16,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:16,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:49:16,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:49:16,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:49:16,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:16,919 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:49:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:16,970 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:49:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:49:16,971 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:49:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:16,972 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:49:16,972 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:49:16,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:49:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:49:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:49:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:49:16,976 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:49:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:16,976 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:49:16,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:49:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:49:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:49:16,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:16,977 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:49:16,977 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:16,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2019-08-05 10:49:16,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:17,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:49:17,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:17,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:49:17,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:49:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:49:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:49:17,617 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:49:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:17,676 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:49:17,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:49:17,677 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:49:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:17,677 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:49:17,677 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:49:17,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 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:49:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:49:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:49:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:49:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:49:17,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:49:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:17,680 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:49:17,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:49:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:49:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:49:17,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:17,681 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:49:17,681 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2019-08-05 10:49:17,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:17,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:49:17,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:18,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:49:18,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:49:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:49:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:49:18,933 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:49:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:19,094 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:49:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:49:19,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:49:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:19,095 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:49:19,095 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:49:19,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:49:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:49:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:49:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:49:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:49:19,098 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:49:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,098 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:49:19,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:49:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:49:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:49:19,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,099 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:49:19,099 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2019-08-05 10:49:19,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:19,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:49:19,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:19,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:19,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:49:19,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:49:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:49:19,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:49:19,564 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:49:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:19,617 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:49:19,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:49:19,618 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:49:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:19,619 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:49:19,619 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:49:19,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:49:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:49:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:49:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:49:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:49:19,623 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:49:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,623 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:49:19,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:49:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:49:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:49:19,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,624 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:49:19,624 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,625 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2019-08-05 10:49:19,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:19,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:49:19,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:20,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:49:20,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:49:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:49:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:49:20,484 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:49:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:20,535 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:49:20,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:49:20,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:49:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:20,537 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:49:20,537 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:49:20,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:49:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:49:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:49:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:49:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:49:20,541 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:49:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:20,541 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:49:20,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:49:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:49:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:49:20,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:20,542 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:49:20,542 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2019-08-05 10:49:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:21,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:21,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:49:21,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:49:21,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:49:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:49:21,085 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:49:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:21,176 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:49:21,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:49:21,176 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:49:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:21,177 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:49:21,177 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:49:21,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:49:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:49:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:49:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:49:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:49:21,181 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:49:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:21,182 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:49:21,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:49:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:49:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:49:21,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:21,184 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:49:21,184 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2019-08-05 10:49:21,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:21,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:49:21,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:21,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:21,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:49:21,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:49:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:49:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:49:21,828 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:49:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:21,877 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:49:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:49:21,877 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:49:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:21,878 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:49:21,878 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:49:21,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:49:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:49:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:49:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:49:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:49:21,882 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:49:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:21,882 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:49:21,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:49:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:49:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:49:21,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:21,883 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:49:21,883 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2019-08-05 10:49:21,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:21,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:49:21,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:23,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:23,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:49:23,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:49:23,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:49:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:49:23,591 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:49:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:23,719 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:49:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:49:23,720 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:49:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:23,720 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:49:23,720 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:49:23,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:49:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:49:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:49:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:49:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:49:23,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:49:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:23,724 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:49:23,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:49:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:49:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:49:23,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:23,725 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:49:23,725 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2019-08-05 10:49:23,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:23,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:49:23,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:24,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:24,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:49:24,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:49:24,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:49:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:49:24,220 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:49:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:24,259 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:49:24,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:49:24,260 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:49:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:24,260 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:49:24,261 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:49:24,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:49:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:49:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:49:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:49:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:49:24,264 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:49:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:24,265 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:49:24,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:49:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:49:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:49:24,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:24,265 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:49:24,265 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2019-08-05 10:49:24,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:24,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:49:24,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:24,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:49:24,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:49:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:49:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:49:24,975 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:49:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:25,020 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:49:25,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:49:25,021 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:49:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:25,022 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:49:25,022 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:49:25,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:49:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:49:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:49:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:49:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:49:25,025 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:49:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:25,025 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:49:25,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:49:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:49:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:49:25,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:25,026 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:49:25,026 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:25,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2019-08-05 10:49:25,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:25,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:49:25,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:25,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:25,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:49:25,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:49:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:49:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:49:25,645 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:49:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:25,687 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:49:25,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:49:25,688 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:49:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:25,689 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:49:25,689 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:49:25,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:49:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:49:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:49:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:49:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:49:25,692 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:49:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:25,693 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:49:25,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:49:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:49:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:49:25,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:25,694 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:49:25,694 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:25,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2019-08-05 10:49:25,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:25,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:49:25,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:26,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:26,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:49:26,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:49:26,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:49:26,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:49:26,326 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:49:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:26,400 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:49:26,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:49:26,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:49:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:26,401 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:49:26,401 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:49:26,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 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:49:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:49:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:49:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:49:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:49:26,403 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:49:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:26,403 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:49:26,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:49:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:49:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:49:26,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:26,404 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:49:26,404 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2019-08-05 10:49:26,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:26,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:49:26,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:49:28,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:49:28,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:49:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:49:28,134 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:49:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,178 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:49:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:49:28,179 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:49:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,180 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:49:28,180 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:49:28,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:49:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:49:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:49:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:49:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:49:28,183 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:49:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,183 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:49:28,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:49:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:49:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:49:28,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,184 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:49:28,185 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2019-08-05 10:49:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:49:28,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:49:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:49:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:49:28,890 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:49:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,958 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:49:28,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:49:28,958 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:49:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,959 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:49:28,959 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:49:28,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:49:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:49:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:49:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:49:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:49:28,962 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:49:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,963 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:49:28,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:49:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:49:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:49:28,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,963 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:49:28,964 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2019-08-05 10:49:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:29,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:49:29,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:49:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:49:29,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:49:29,778 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:49:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:29,828 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:49:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:49:29,828 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:49:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:29,829 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:49:29,829 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:49:29,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:49:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:49:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:49:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:49:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:49:29,833 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:49:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:29,833 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:49:29,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:49:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:49:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:49:29,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:29,834 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:49:29,834 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2019-08-05 10:49:29,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:29,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:49:29,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:31,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:31,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:49:31,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:49:31,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:49:31,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:49:31,195 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:49:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:31,247 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:49:31,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:49:31,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:49:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:31,248 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:49:31,248 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:49:31,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:49:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:49:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:49:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:49:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:49:31,252 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:49:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:31,252 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:49:31,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:49:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:49:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:49:31,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:31,253 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:49:31,253 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2019-08-05 10:49:31,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:31,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:49:31,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:32,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:32,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:49:32,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:49:32,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:49:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:49:32,269 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:49:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:32,347 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:49:32,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:49:32,348 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:49:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:32,349 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:49:32,349 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:49:32,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:49:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:49:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:49:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:49:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:49:32,351 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:49:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:32,352 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:49:32,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:49:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:49:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:49:32,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:32,352 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:49:32,352 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2019-08-05 10:49:32,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:32,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:49:32,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:33,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:33,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:49:33,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:49:33,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:49:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:33,136 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:49:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:33,208 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:49:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:49:33,208 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:49:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:33,209 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:49:33,209 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:49:33,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:49:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:49:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:49:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:49:33,212 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:49:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:33,212 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:49:33,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:49:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:49:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:49:33,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:33,213 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:49:33,213 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2019-08-05 10:49:33,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:33,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:49:33,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:33,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:33,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:49:33,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:49:33,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:49:33,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:33,953 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:49:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:34,009 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:49:34,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:49:34,009 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:49:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:34,010 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:49:34,010 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:49:34,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:49:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:49:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:49:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:49:34,014 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:49:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:34,014 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:49:34,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:49:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:49:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:49:34,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:34,015 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:49:34,015 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:34,016 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2019-08-05 10:49:34,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:34,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:49:34,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:35,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:35,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:49:35,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:49:35,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:49:35,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:49:35,159 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:49:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:35,238 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:49:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:49:35,240 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:49:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:35,241 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:49:35,241 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:49:35,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:49:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:49:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:49:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:49:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:49:35,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:49:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:35,244 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:49:35,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:49:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:49:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:49:35,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:35,245 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:49:35,245 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2019-08-05 10:49:35,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:35,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:49:35,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:36,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:36,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:49:36,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:49:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:49:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:49:36,219 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:49:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:36,292 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:49:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:49:36,292 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:49:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:36,293 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:49:36,293 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:49:36,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:49:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:49:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:49:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:49:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:49:36,296 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:49:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:36,296 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:49:36,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:49:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:49:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:49:36,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:36,297 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:49:36,297 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2019-08-05 10:49:36,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:36,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:49:36,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:37,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:37,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:49:37,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:49:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:49:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:49:37,733 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:49:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:38,013 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:49:38,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:49:38,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:49:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:38,014 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:49:38,015 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:49:38,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:49:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:49:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:49:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:49:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:49:38,017 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:49:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:38,017 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:49:38,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:49:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:49:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:49:38,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:38,018 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:49:38,018 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2019-08-05 10:49:38,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:38,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:49:38,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:38,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:38,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:49:38,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:49:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:49:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:49:38,997 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:49:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,068 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:49:39,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:49:39,068 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:49:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,069 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:49:39,069 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:49:39,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:49:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:49:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:49:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:49:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:49:39,072 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:49:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,072 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:49:39,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:49:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:49:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:49:39,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,073 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:49:39,073 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,073 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2019-08-05 10:49:39,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:39,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:49:39,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:49:39,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:49:39,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:49:39,934 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:49:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,994 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:49:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:49:39,994 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:49:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,995 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:49:39,995 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:49:39,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:49:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:49:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:49:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:49:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:49:39,999 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:49:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,999 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:49:39,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:49:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:49:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:49:40,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:40,000 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:49:40,000 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:40,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2019-08-05 10:49:40,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:40,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:49:40,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:41,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:41,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:49:41,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:49:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:49:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:49:41,018 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:49:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:41,089 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:49:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:49:41,089 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:49:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:41,090 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:49:41,090 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:49:41,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:49:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:49:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:49:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:49:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:49:41,093 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:49:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:41,094 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:49:41,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:49:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:49:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:49:41,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:41,094 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:49:41,095 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2019-08-05 10:49:41,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:41,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:49:41,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:42,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:42,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:49:42,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:49:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:49:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:42,172 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:49:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:42,229 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:49:42,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:49:42,230 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:49:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:42,230 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:49:42,230 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:49:42,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:49:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:49:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:49:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:49:42,234 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:49:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:42,234 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:49:42,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:49:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:49:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:49:42,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:42,241 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:49:42,241 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2019-08-05 10:49:42,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:42,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:49:42,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:43,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:49:43,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:49:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:49:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:43,401 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:49:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:43,483 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:49:43,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:49:43,484 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:49:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:43,485 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:49:43,485 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:49:43,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:49:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:49:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:49:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:49:43,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:49:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:43,487 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:49:43,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:49:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:49:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:49:43,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:43,488 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:49:43,488 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2019-08-05 10:49:43,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:43,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:49:43,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:44,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:44,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:49:44,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:49:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:49:44,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:44,830 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:49:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:44,920 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:49:44,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:49:44,921 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:49:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:44,921 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:49:44,922 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:49:44,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 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:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:49:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:49:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:49:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:49:44,924 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:49:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:44,924 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:49:44,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:49:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:49:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:49:44,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:44,925 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:49:44,925 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2019-08-05 10:49:44,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:44,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:49:44,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:45,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:49:45,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:49:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:49:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:45,986 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:49:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:46,072 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:49:46,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:49:46,072 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:49:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:46,073 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:49:46,073 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:49:46,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:49:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:49:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:49:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:49:46,076 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:49:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:46,076 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:49:46,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:49:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:49:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:49:46,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:46,077 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:49:46,077 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2019-08-05 10:49:46,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:46,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:49:46,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:47,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:47,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:49:47,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:49:47,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:49:47,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:47,444 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:49:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:47,512 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:49:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:49:47,512 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:49:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:47,513 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:49:47,513 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:49:47,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:49:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:49:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:49:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:49:47,516 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:49:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:47,517 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:49:47,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:49:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:49:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:49:47,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:47,517 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:49:47,518 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2019-08-05 10:49:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:47,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:49:47,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:48,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:48,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:49:48,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:49:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:49:48,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:48,783 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:49:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:48,863 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:49:48,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:49:48,863 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:49:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:48,864 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:49:48,864 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:49:48,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:49:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:49:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:49:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:49:48,867 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:49:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:48,867 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:49:48,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:49:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:49:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:49:48,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:48,868 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:49:48,868 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2019-08-05 10:49:48,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:48,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:49:48,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:50,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:50,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:49:50,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:49:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:49:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:50,140 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:49:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:50,213 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:49:50,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:49:50,214 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:49:50,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:50,214 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:49:50,215 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:49:50,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:49:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:49:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:49:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:49:50,218 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:49:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:50,218 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:49:50,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:49:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:49:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:49:50,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:50,219 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:49:50,219 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2019-08-05 10:49:50,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:50,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:49:50,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:51,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:51,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:49:51,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:49:51,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:49:51,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:51,419 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:49:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:51,500 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:49:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:49:51,500 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:49:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:51,501 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:49:51,502 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:49:51,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:49:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:49:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:49:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:49:51,505 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:49:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:51,505 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:49:51,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:49:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:49:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:49:51,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:51,506 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:49:51,506 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2019-08-05 10:49:51,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:51,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:49:51,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:53,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:53,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:49:53,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:49:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:49:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:53,784 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:49:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:53,856 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:49:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:49:53,856 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:49:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:53,857 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:49:53,857 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:49:53,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:49:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:49:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:49:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:49:53,860 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:49:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:53,860 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:49:53,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:49:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:49:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:49:53,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:53,861 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:49:53,861 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2019-08-05 10:49:53,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:53,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:49:53,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:55,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:55,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:49:55,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:49:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:49:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:55,226 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:49:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:55,294 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:49:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:49:55,295 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:49:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:55,295 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:49:55,296 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:49:55,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:49:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:49:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:49:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:49:55,298 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:49:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:55,299 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:49:55,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:49:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:49:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:49:55,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:55,300 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:49:55,301 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2019-08-05 10:49:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:55,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:49:55,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:56,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:49:56,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:49:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:49:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:56,855 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:49:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:56,945 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:49:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:49:56,945 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:49:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:56,946 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:49:56,946 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:49:56,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:49:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:49:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:49:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:49:56,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:49:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:56,949 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:49:56,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:49:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:49:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:49:56,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:56,950 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:49:56,950 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:56,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:56,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2019-08-05 10:49:56,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:56,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:49:56,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:58,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:58,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:49:58,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:49:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:49:58,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:58,418 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:49:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:58,503 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:49:58,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:49:58,503 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:49:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:58,504 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:49:58,504 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:49:58,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:49:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:49:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:49:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:49:58,507 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:49:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:58,507 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:49:58,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:49:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:49:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:49:58,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:58,508 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:49:58,508 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2019-08-05 10:49:58,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:58,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:49:58,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:59,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:49:59,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:49:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:49:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:49:59,917 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:50:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:00,014 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:50:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:50:00,015 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:50:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:00,015 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:50:00,016 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:50:00,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:50:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:50:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:50:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:50:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:50:00,019 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:50:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:00,019 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:50:00,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:50:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:50:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:50:00,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:00,020 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:50:00,020 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2019-08-05 10:50:00,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:00,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:50:00,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:50:01,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:50:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:50:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:50:01,481 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:50:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:01,574 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:50:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:50:01,574 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:50:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:01,575 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:50:01,575 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:50:01,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:50:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:50:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:50:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:50:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:50:01,577 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:50:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:01,578 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:50:01,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:50:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:50:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:50:01,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:01,579 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:50:01,579 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2019-08-05 10:50:01,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:01,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:50:01,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:03,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:03,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:50:03,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:50:03,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:50:03,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:50:03,587 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:50:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:03,705 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:50:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:50:03,706 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:50:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:03,707 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:50:03,707 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:50:03,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:50:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:50:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:50:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:50:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:50:03,710 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:50:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:03,710 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:50:03,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:50:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:50:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:50:03,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:03,711 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:50:03,711 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2019-08-05 10:50:03,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:03,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:50:03,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:05,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:05,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:50:05,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:50:05,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:50:05,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:50:05,390 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:50:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:05,494 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:50:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:50:05,494 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:50:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:05,495 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:50:05,495 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:50:05,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:50:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:50:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:50:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:50:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:50:05,498 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:50:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:05,498 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:50:05,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:50:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:50:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:50:05,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:05,499 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:50:05,499 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2019-08-05 10:50:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:05,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:50:05,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:07,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:50:07,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:50:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:50:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:07,148 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:50:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:07,229 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:50:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:50:07,230 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:50:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:07,230 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:50:07,231 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:50:07,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:50:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:50:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:50:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:50:07,233 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:50:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:07,234 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:50:07,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:50:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:50:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:50:07,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:07,234 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:50:07,234 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:07,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2019-08-05 10:50:07,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:07,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:50:07,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:09,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:09,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:50:09,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:50:09,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:50:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:09,889 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:50:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:09,981 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:50:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:50:09,981 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:50:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:09,982 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:50:09,982 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:50:09,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:50:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:50:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:50:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:50:09,985 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:50:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:09,985 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:50:09,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:50:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:50:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:50:09,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:09,986 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:50:09,986 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2019-08-05 10:50:09,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:10,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:50:10,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:11,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:11,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:50:11,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:50:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:50:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:11,706 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:50:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:11,801 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:50:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:50:11,801 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:50:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:11,802 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:50:11,802 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:50:11,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:50:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:50:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:50:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:50:11,805 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:50:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:11,806 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:50:11,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:50:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:50:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:50:11,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:11,806 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:50:11,807 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2019-08-05 10:50:11,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:11,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:50:11,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:13,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:13,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:50:13,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:50:13,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:50:13,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:50:13,807 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:50:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:13,912 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:50:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:50:13,912 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:50:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:13,913 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:50:13,913 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:50:13,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:50:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:50:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:50:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:50:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:50:13,916 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:50:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:13,916 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:50:13,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:50:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:50:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:50:13,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:13,917 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:50:13,917 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2019-08-05 10:50:13,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:13,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:50:13,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:15,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:15,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:50:15,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:50:15,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:50:15,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:15,950 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:50:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:16,050 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:50:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:50:16,050 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:50:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:16,051 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:50:16,052 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:50:16,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:50:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:50:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:50:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:50:16,055 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:50:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:50:16,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:50:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:50:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:50:16,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:16,056 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:50:16,056 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2019-08-05 10:50:16,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:16,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:50:16,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:18,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:18,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:50:18,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:50:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:50:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:50:18,072 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:50:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:18,172 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:50:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:50:18,172 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:50:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:18,173 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:50:18,174 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:50:18,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:50:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:50:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:50:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:50:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:50:18,176 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:50:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:18,177 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:50:18,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:50:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:50:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:50:18,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:18,177 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:50:18,178 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2019-08-05 10:50:18,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:18,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:50:18,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:20,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:20,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:50:20,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:50:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:50:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:50:20,126 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:50:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:20,221 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:50:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:50:20,221 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:50:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:20,222 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:50:20,223 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:50:20,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:50:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:50:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:50:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:50:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:50:20,226 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:50:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:20,226 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:50:20,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:50:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:50:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:50:20,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:20,227 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:50:20,227 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:20,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2019-08-05 10:50:20,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:20,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:50:20,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:50:22,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:50:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:50:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:50:22,265 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:50:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:22,368 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:50:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:50:22,368 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:50:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:22,369 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:50:22,369 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:50:22,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:50:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:50:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:50:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:50:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:50:22,373 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:50:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:22,373 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:50:22,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:50:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:50:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:50:22,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:22,374 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:50:22,374 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2019-08-05 10:50:22,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:22,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:50:22,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:24,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:24,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:50:24,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:50:24,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:50:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:50:24,650 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:50:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:24,746 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:50:24,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:50:24,746 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:50:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:24,747 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:50:24,747 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:50:24,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:50:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:50:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:50:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:50:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:50:24,750 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:50:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:24,751 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:50:24,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:50:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:50:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:50:24,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:24,751 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:50:24,752 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2019-08-05 10:50:24,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:24,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:50:24,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:27,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:27,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:50:27,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:50:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:50:27,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:50:27,134 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:50:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:27,227 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:50:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:50:27,228 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:50:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:27,229 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:50:27,229 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:50:27,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:50:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:50:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:50:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:50:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:50:27,232 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:50:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:27,232 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:50:27,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:50:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:50:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:50:27,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:27,233 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:50:27,233 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2019-08-05 10:50:27,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:27,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:50:27,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:29,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:29,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:50:29,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:50:29,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:50:29,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:50:29,546 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:50:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:29,648 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:50:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:50:29,649 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:50:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:29,650 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:50:29,650 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:50:29,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:50:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:50:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:50:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:50:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:50:29,652 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:50:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:29,652 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:50:29,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:50:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:50:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:50:29,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:29,653 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:50:29,653 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2019-08-05 10:50:29,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:29,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:50:29,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:31,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:31,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:50:31,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:50:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:50:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:50:31,791 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:50:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:31,894 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:50:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:50:31,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:50:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:31,895 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:50:31,896 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:50:31,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:50:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:50:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:50:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:50:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:50:31,900 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:50:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:31,900 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:50:31,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:50:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:50:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:50:31,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:31,901 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:50:31,901 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2019-08-05 10:50:31,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:31,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:50:31,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:34,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:34,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:50:34,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:50:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:50:34,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:50:34,409 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:50:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:34,935 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:50:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:50:34,935 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:50:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:34,936 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:50:34,936 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:50:34,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:50:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:50:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:50:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:50:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:50:34,939 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:50:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:34,939 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:50:34,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:50:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:50:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:50:34,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:34,940 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:50:34,940 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2019-08-05 10:50:34,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:34,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:50:34,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:37,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:37,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:50:37,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:50:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:50:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:50:37,203 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:50:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:37,377 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:50:37,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:50:37,377 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:50:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:37,378 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:50:37,378 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:50:37,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:50:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:50:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:50:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:50:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:50:37,380 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:50:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:37,381 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:50:37,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:50:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:50:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:50:37,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:37,382 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:50:37,382 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2019-08-05 10:50:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:37,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:50:37,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:40,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:40,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:50:40,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:50:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:50:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:50:40,007 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:50:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:40,118 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:50:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:50:40,119 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:50:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:40,120 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:50:40,120 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:50:40,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:50:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:50:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:50:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:50:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:50:40,122 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:50:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:40,123 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:50:40,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:50:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:50:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:50:40,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:40,124 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:50:40,124 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:40,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2019-08-05 10:50:40,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:40,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:50:40,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:42,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:42,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:50:42,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:50:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:50:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:50:42,574 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:50:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:42,689 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:50:42,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:50:42,690 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:50:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:42,691 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:50:42,691 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:50:42,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:50:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:50:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:50:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:50:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:50:42,694 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:50:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:42,694 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:50:42,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:50:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:50:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:50:42,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:42,695 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:50:42,695 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2019-08-05 10:50:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:42,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:50:42,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:45,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:45,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:50:45,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:50:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:50:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:50:45,455 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:50:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:45,719 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:50:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:50:45,720 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:50:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:45,721 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:50:45,721 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:50:45,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:50:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:50:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:50:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:50:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:50:45,724 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:50:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:45,724 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:50:45,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:50:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:50:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:50:45,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:45,725 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:50:45,725 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2019-08-05 10:50:45,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:45,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:50:45,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:48,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:50:48,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:50:48,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:50:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:50:48,334 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:50:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:48,489 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:50:48,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:50:48,490 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:50:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:48,490 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:50:48,490 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:50:48,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 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:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:50:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:50:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:50:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:50:48,493 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:50:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:48,493 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:50:48,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:50:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:50:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:50:48,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:48,494 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:50:48,494 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2019-08-05 10:50:48,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:48,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:50:48,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:51,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:51,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:50:51,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:50:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:50:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:50:51,115 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:50:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:51,325 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:50:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:50:51,326 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:50:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:51,327 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:50:51,327 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:50:51,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:50:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:50:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:50:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:50:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:50:51,330 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:50:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:51,330 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:50:51,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:50:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:50:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:50:51,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:51,331 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:50:51,331 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2019-08-05 10:50:51,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:51,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:50:51,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:54,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:54,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:50:54,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:50:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:50:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:50:54,223 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:50:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:54,347 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:50:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:50:54,348 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:50:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:54,349 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:50:54,349 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:50:54,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:50:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:50:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:50:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:50:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:50:54,352 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:50:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:54,352 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:50:54,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:50:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:50:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:50:54,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:54,353 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:50:54,354 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:54,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2019-08-05 10:50:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:54,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:50:54,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:57,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:57,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:50:57,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:50:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:50:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:50:57,020 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:50:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:57,208 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:50:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:50:57,209 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:50:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:57,209 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:50:57,210 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:50:57,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:50:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:50:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:50:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:50:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:50:57,212 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:50:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:57,212 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:50:57,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:50:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:50:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:50:57,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:57,213 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:50:57,213 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2019-08-05 10:50:57,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:57,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:50:57,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:59,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:59,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:50:59,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:50:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:50:59,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:50:59,910 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:51:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:00,033 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:51:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:51:00,033 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:51:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:00,034 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:51:00,034 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:51:00,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:51:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:51:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:51:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:51:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:51:00,037 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:51:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:00,037 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:51:00,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:51:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:51:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:51:00,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:00,038 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:51:00,038 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2019-08-05 10:51:00,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:00,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:51:00,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:02,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:02,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:51:02,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:51:02,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:51:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:51:02,845 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:51:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:02,958 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:51:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:51:02,958 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:51:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:02,959 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:51:02,959 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:51:02,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 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:51:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:51:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:51:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:51:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:51:02,962 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:51:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:02,962 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:51:02,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:51:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:51:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:51:02,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:02,963 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:51:02,963 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2019-08-05 10:51:02,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:03,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:51:03,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:05,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:05,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:51:05,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:51:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:51:05,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:51:05,979 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:51:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:06,111 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:51:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:51:06,111 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:51:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:06,112 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:51:06,112 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:51:06,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 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:51:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:51:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:51:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:51:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:51:06,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:51:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:06,115 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:51:06,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:51:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:51:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:51:06,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:06,116 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:51:06,117 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2019-08-05 10:51:06,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:06,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:51:06,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:09,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:09,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:51:09,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:51:09,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:51:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:51:09,397 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:51:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:10,010 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:51:10,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:51:10,011 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:51:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:10,011 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:51:10,012 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:51:10,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:51:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:51:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:51:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:51:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:51:10,014 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:51:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:10,014 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:51:10,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:51:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:51:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:51:10,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:10,015 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:51:10,015 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2019-08-05 10:51:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:10,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:51:10,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:12,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:12,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:51:12,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:51:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:51:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:51:12,965 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:51:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:13,078 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:51:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:51:13,078 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:51:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:13,079 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:51:13,079 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:51:13,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 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:51:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:51:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:51:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:51:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:51:13,082 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:51:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:13,082 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:51:13,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:51:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:51:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:51:13,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:13,083 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:51:13,083 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2019-08-05 10:51:13,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:13,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:51:13,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:16,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:16,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:51:16,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:51:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:51:16,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:51:16,241 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:51:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:16,366 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:51:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:51:16,367 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:51:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:16,368 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:51:16,368 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:51:16,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:51:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:51:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:51:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:51:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:51:16,370 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:51:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:16,371 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:51:16,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:51:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:51:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:51:16,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:16,372 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:51:16,372 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2019-08-05 10:51:16,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:16,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:51:16,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:19,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:19,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:51:19,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:51:19,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:51:19,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:51:19,677 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:51:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:19,810 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:51:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:51:19,810 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:51:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:19,811 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:51:19,811 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:51:19,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:51:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:51:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:51:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:51:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:51:19,814 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:51:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:19,814 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:51:19,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:51:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:51:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:51:19,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:19,815 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:51:19,815 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:19,816 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2019-08-05 10:51:19,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:19,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:51:19,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:22,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:51:22,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:51:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:51:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:51:22,989 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:51:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:23,117 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:51:23,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:51:23,118 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:51:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:23,119 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:51:23,119 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:51:23,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:51:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:51:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:51:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:51:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:51:23,122 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:51:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:23,122 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:51:23,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:51:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:51:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:51:23,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:23,123 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:51:23,124 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2019-08-05 10:51:23,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:23,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:51:23,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:27,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:27,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:51:27,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:51:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:51:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:51:27,151 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:51:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:27,286 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:51:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:51:27,286 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:51:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:27,287 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:51:27,287 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:51:27,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:51:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:51:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:51:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:51:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:51:27,290 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:51:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:27,290 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:51:27,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:51:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:51:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:51:27,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:27,291 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:51:27,291 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2019-08-05 10:51:27,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:27,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:51:27,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:30,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:30,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:51:30,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:51:30,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:51:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:51:30,968 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:51:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:31,097 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:51:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:51:31,099 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:51:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:31,099 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:51:31,099 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:51:31,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:51:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:51:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:51:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:51:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:51:31,102 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:51:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:31,102 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:51:31,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:51:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:51:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:51:31,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:31,103 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:51:31,103 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2019-08-05 10:51:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:31,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:51:31,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:34,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:34,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:51:34,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:51:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:51:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:51:34,480 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:51:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:34,708 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:51:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:51:34,708 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:51:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:34,709 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:51:34,709 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:51:34,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:51:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:51:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:51:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:51:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:51:34,711 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:51:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:34,711 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:51:34,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:51:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:51:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:51:34,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:34,712 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:51:34,712 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2019-08-05 10:51:34,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:34,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:51:34,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:38,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:38,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:51:38,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:51:38,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:51:38,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:51:38,160 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:51:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:38,464 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:51:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:51:38,465 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:51:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:38,466 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:51:38,466 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:51:38,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:51:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:51:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:51:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:51:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:51:38,468 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:51:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:38,468 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:51:38,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:51:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:51:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:51:38,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:38,468 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:51:38,469 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2019-08-05 10:51:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:38,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:51:38,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:42,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:42,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:51:42,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:51:42,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:51:42,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:51:42,245 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:51:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:42,385 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:51:42,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:51:42,385 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:51:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:42,386 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:51:42,386 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:51:42,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:51:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:51:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:51:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:51:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:51:42,390 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:51:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:42,390 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:51:42,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:51:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:51:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:51:42,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:42,391 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:51:42,391 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2019-08-05 10:51:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:46,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:46,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:51:46,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:51:46,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:51:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:46,190 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:51:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:46,347 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:51:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:51:46,348 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:51:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:46,349 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:51:46,349 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:51:46,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:51:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:51:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:51:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:51:46,352 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:51:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:46,352 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:51:46,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:51:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:51:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:51:46,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:46,353 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:51:46,353 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:46,353 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2019-08-05 10:51:46,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:46,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:51:46,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:50,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:51:50,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:51:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:51:50,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:51:50,155 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:51:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:50,294 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:51:50,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:51:50,295 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:51:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:50,296 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:51:50,296 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:51:50,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:51:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:51:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:51:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:51:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:51:50,299 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:51:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:50,299 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:51:50,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:51:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:51:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:51:50,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:50,300 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:51:50,301 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2019-08-05 10:51:50,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:50,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:51:50,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:54,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:54,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:51:54,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:51:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:51:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:51:54,011 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:51:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:54,185 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:51:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:51:54,185 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:51:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:54,186 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:51:54,187 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:51:54,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:51:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:51:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:51:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:51:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:51:54,190 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:51:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:54,190 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:51:54,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:51:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:51:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:51:54,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:54,191 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:51:54,191 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2019-08-05 10:51:54,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:54,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:51:54,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:58,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:58,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:51:58,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:51:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:51:58,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:51:58,421 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:51:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:58,618 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:51:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:51:58,618 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:51:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:58,619 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:51:58,619 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:51:58,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:51:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:51:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:51:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:51:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:51:58,623 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:51:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:58,623 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:51:58,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:51:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:51:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:51:58,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:58,624 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:51:58,624 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2019-08-05 10:51:58,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:58,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:51:58,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:02,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:02,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:52:02,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:52:02,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:52:02,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:52:02,748 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:52:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:02,906 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:52:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:52:02,907 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:52:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:02,907 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:52:02,908 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:52:02,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:52:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:52:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:52:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:52:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:52:02,910 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:52:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:02,911 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:52:02,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:52:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:52:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:52:02,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:02,912 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:52:02,912 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2019-08-05 10:52:02,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:03,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:52:03,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:07,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:07,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:52:07,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:52:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:52:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:52:07,512 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:52:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:07,728 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:52:07,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:52:07,728 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:52:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:07,729 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:52:07,729 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:52:07,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:52:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:52:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:52:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:52:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:52:07,731 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:52:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:07,731 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:52:07,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:52:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:52:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:52:07,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:07,732 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:52:07,732 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2019-08-05 10:52:07,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:07,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:52:07,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:11,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:11,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:52:11,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:52:11,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:52:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:52:11,997 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:52:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:12,151 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:52:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:52:12,151 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:52:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:12,152 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:52:12,152 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:52:12,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:52:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:52:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:52:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:52:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:52:12,156 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:52:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:12,156 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:52:12,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:52:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:52:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:52:12,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:12,157 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:52:12,157 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2019-08-05 10:52:12,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:12,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:52:12,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:16,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:52:16,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:52:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:52:16,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:52:16,464 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:52:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:16,637 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:52:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:52:16,638 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:52:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:16,638 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:52:16,638 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:52:16,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:52:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:52:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:52:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:52:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:52:16,641 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:52:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:16,641 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:52:16,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:52:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:52:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:52:16,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:16,642 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:52:16,642 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2019-08-05 10:52:16,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:16,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:52:16,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:21,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:21,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:52:21,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:52:21,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:52:21,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:52:21,094 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:52:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:21,316 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:52:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:52:21,317 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:52:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:21,317 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:52:21,317 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:52:21,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:52:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:52:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:52:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:52:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:52:21,321 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:52:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:21,321 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:52:21,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:52:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:52:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:52:21,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:21,321 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:52:21,322 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2019-08-05 10:52:21,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:21,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:52:21,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:25,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:25,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:52:25,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:52:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:52:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:52:25,372 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:52:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:25,545 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:52:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:52:25,546 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:52:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:25,546 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:52:25,547 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:52:25,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:52:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:52:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:52:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:52:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:52:25,550 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:52:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:25,550 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:52:25,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:52:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:52:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:52:25,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:25,551 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:52:25,551 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2019-08-05 10:52:25,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:25,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:52:25,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:30,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:30,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:52:30,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:52:30,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:52:30,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:52:30,071 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:52:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:30,277 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:52:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:52:30,277 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:52:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:30,278 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:52:30,278 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:52:30,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:52:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:52:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:52:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:52:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:52:30,280 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:52:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:30,280 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:52:30,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:52:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:52:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:52:30,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:30,281 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:52:30,281 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2019-08-05 10:52:30,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:30,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:52:30,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:34,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:34,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:52:34,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:52:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:52:34,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:52:34,850 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:52:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:35,025 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:52:35,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:52:35,025 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:52:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:35,026 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:52:35,026 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:52:35,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:52:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:52:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:52:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:52:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:52:35,029 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:52:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:35,029 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:52:35,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:52:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:52:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:52:35,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:35,030 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:52:35,030 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2019-08-05 10:52:35,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:39,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:39,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:52:39,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:52:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:52:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:52:39,766 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:52:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:39,958 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:52:39,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:52:39,958 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:52:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:39,959 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:52:39,959 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:52:39,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 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:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:52:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:52:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:52:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:52:39,963 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:52:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:39,963 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:52:39,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:52:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:52:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:52:39,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:39,964 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:52:39,964 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:39,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1079318975, now seen corresponding path program 112 times [2019-08-05 10:52:39,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:40,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:52:40,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:44,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:44,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:52:44,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:52:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:52:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:52:44,748 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:52:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:44,967 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:52:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:52:44,968 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:52:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:44,968 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:52:44,969 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:52:44,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:52:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:52:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:52:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:52:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:52:44,970 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:52:44,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:44,971 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:52:44,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:52:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:52:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:52:44,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:44,971 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:52:44,972 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash 900848168, now seen corresponding path program 113 times [2019-08-05 10:52:44,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:45,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:52:45,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:49,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:52:49,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:52:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:52:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:52:49,752 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:52:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:49,931 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:52:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:52:49,931 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:52:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:49,932 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:52:49,932 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:52:49,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:52:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:52:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:52:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:52:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:52:49,936 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:52:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:49,936 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:52:49,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:52:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:52:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:52:49,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:49,937 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:52:49,937 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2138479839, now seen corresponding path program 114 times [2019-08-05 10:52:49,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:50,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:52:50,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:54,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:54,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:52:54,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:52:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:52:54,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:52:54,908 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:52:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:55,091 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:52:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:52:55,091 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:52:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:55,092 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:52:55,092 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:52:55,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:52:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:52:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:52:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:52:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:52:55,095 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:52:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:55,095 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:52:55,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:52:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:52:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:52:55,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:55,096 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:52:55,096 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1868367544, now seen corresponding path program 115 times [2019-08-05 10:52:55,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:55,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:52:55,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:00,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:00,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:53:00,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:53:00,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:53:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:53:00,024 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:53:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:00,256 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:53:00,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:53:00,256 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:53:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:00,257 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:53:00,257 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:53:00,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:53:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:53:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:53:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:53:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:53:00,260 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:53:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:00,260 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:53:00,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:53:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:53:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:53:00,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:00,261 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:53:00,261 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2084820991, now seen corresponding path program 116 times [2019-08-05 10:53:00,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:00,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:53:00,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:53:03,785 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:53:03,785 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:53:03,789 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:53:03,789 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:53:03 BoogieIcfgContainer [2019-08-05 10:53:03,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:53:03,791 INFO L168 Benchmark]: Toolchain (without parser) took 238356.89 ms. Allocated memory was 133.7 MB in the beginning and 1.1 GB in the end (delta: 916.5 MB). Free memory was 108.8 MB in the beginning and 168.0 MB in the end (delta: -59.2 MB). Peak memory consumption was 857.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:03,792 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:53:03,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.41 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.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:53:03,793 INFO L168 Benchmark]: Boogie Preprocessor took 18.66 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 105.9 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:53:03,794 INFO L168 Benchmark]: RCFGBuilder took 339.23 ms. Allocated memory is still 133.7 MB. Free memory was 105.9 MB in the beginning and 96.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:03,794 INFO L168 Benchmark]: TraceAbstraction took 237962.45 ms. Allocated memory was 133.7 MB in the beginning and 1.1 GB in the end (delta: 916.5 MB). Free memory was 95.9 MB in the beginning and 168.0 MB in the end (delta: -72.1 MB). Peak memory consumption was 844.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:03,797 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.20 ms. Allocated memory is still 133.7 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.41 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.66 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 105.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.23 ms. Allocated memory is still 133.7 MB. Free memory was 105.9 MB in the beginning and 96.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237962.45 ms. Allocated memory was 133.7 MB in the beginning and 1.1 GB in the end (delta: 916.5 MB). Free memory was 95.9 MB in the beginning and 168.0 MB in the end (delta: -72.1 MB). Peak memory consumption was 844.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 120 with TraceHistMax 116,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 97 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 237.8s OverallTime, 117 OverallIterations, 116 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 0 SDslu, 1862 SDs, 0 SdLazy, 8764 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6902 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6786 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 212.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred 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.2s AutomataMinimizationTime, 116 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 214.8s InterpolantComputationTime, 7018 NumberOfCodeBlocks, 7018 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 6902 ConstructedInterpolants, 0 QuantifiedInterpolants, 1608398 SizeOfPredicates, 117 NumberOfNonLiveVariables, 75110 ConjunctsInSsa, 6903 ConjunctsInUnsatCore, 116 InterpolantComputations, 1 PerfectInterpolantSequences, 0/260130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown