java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:18:18,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:18:18,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:18:18,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:18:18,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:18:18,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:18:18,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:18:18,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:18:18,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:18:18,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:18:18,774 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:18:18,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:18:18,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:18:18,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:18:18,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:18:18,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:18:18,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:18:18,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:18:18,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:18:18,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:18:18,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:18:18,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:18:18,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:18:18,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:18:18,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:18:18,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:18:18,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:18:18,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:18:18,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:18:18,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:18:18,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:18:18,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:18:18,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:18:18,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:18:18,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:18:18,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:18:18,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:18:18,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:18:18,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:18:18,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:18:18,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:18:18,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:18:18,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:18:18,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:18:18,845 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:18:18,846 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:18:18,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-08-05 10:18:18,847 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-08-05 10:18:18,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:18:18,885 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:18:18,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:18:18,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:18:18,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:18:18,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:18:18,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:18:18,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:18:18,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:18:18,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/1) ... [2019-08-05 10:18:18,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:18:18,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:18:18,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:18:18,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:18:18,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (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:18:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:18:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:18:19,249 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:18:19,249 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:18:19,250 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:18:19 BoogieIcfgContainer [2019-08-05 10:18:19,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:18:19,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:18:19,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:18:19,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:18:19,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:18:18" (1/2) ... [2019-08-05 10:18:19,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369be011 and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:18:19, skipping insertion in model container [2019-08-05 10:18:19,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:18:19" (2/2) ... [2019-08-05 10:18:19,258 INFO L109 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-08-05 10:18:19,267 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:18:19,274 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:18:19,290 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:18:19,316 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:18:19,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:18:19,317 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:18:19,318 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:18:19,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:18:19,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:18:19,318 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:18:19,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:18:19,318 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:18:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:18:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:18:19,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:18:19,345 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-08-05 10:18:19,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,528 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:18:19,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:18:19,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:18:19,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:18:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:18:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:18:19,553 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:18:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:19,655 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:18:19,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:18:19,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:18:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:19,672 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:18:19,672 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:18:19,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:18:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:18:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:18:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:18:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:18:19,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-05 10:18:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:19,716 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:18:19,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:18:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:18:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:18:19,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:18:19,721 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-08-05 10:18:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:18:19,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:19,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:18:19,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:18:19,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:18:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:18:19,932 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:18:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,026 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:18:20,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:18:20,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:18:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,028 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:18:20,028 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:18:20,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:18:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:18:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:18:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:18:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:18:20,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:18:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,033 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:18:20,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:18:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:18:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:18:20,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,034 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:18:20,034 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-08-05 10:18:20,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:18:20,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:20,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:18:20,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:18:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:18:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:18:20,137 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 10:18:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,231 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:18:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:18:20,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:18:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,232 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:18:20,233 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:18:20,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:18:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:18:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:18:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:18:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:18:20,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:18:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,239 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:18:20,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:18:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:18:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:18:20,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,241 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 10:18:20,241 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,242 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-08-05 10:18:20,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:18:20,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:20,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:18:20,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:18:20,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:18:20,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:18:20,408 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 10:18:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,544 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:18:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:18:20,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:18:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,546 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:18:20,546 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:18:20,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:18:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:18:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:18:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:18:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:18:20,549 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:18:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,550 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:18:20,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:18:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:18:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:18:20,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,551 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 10:18:20,551 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-08-05 10:18:20,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:20,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:20,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:18:20,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:18:20,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:18:20,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:18:20,825 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 10:18:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,912 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:18:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:18:20,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:18:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,913 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:18:20,913 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:18:20,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:18:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:18:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:18:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:18:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:18:20,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:18:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,919 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:18:20,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:18:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:18:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:18:20,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,920 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 10:18:20,921 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,921 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-08-05 10:18:20,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:18:21,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:18:21,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:18:21,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:18:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:18:21,093 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-08-05 10:18:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:21,226 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 10:18:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:18:21,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 10:18:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:21,227 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:18:21,227 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:18:21,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:18:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:18:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:18:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:18:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:18:21,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-05 10:18:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:21,232 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:18:21,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:18:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:18:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:18:21,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:21,233 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-08-05 10:18:21,233 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-08-05 10:18:21,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:21,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:18:21,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 10:18:21,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:18:21,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:18:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:18:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:18:21,371 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-05 10:18:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:21,442 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:18:21,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:18:21,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 10:18:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:21,445 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:18:21,445 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:18:21,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:18:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:18:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:18:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:18:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:18:21,449 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-05 10:18:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:21,449 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:18:21,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:18:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:18:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:18:21,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:21,451 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-08-05 10:18:21,451 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-08-05 10:18:21,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:21,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:18:21,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 10:18:21,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:18:21,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:18:21,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:18:21,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:21,950 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-08-05 10:18:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:22,012 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 10:18:22,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:18:22,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-05 10:18:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:22,014 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:18:22,014 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:18:22,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:18:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:18:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:18:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:18:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:18:22,018 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-05 10:18:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:22,019 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:18:22,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:18:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:18:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:18:22,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:22,019 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-08-05 10:18:22,020 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-08-05 10:18:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:22,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:18:22,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:18:22,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:18:22,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:18:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:18:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:22,225 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-08-05 10:18:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:22,301 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:18:22,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:18:22,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 10:18:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:22,303 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:18:22,303 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:18:22,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:18:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:18:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:18:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:18:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 10:18:22,308 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-08-05 10:18:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:22,308 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 10:18:22,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:18:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 10:18:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:18:22,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:22,309 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-08-05 10:18:22,310 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-08-05 10:18:22,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:22,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:18:22,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 10:18:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:18:22,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:18:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:18:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:18:22,534 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-08-05 10:18:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:22,633 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 10:18:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:18:22,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 10:18:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:22,636 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:18:22,636 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:18:22,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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:18:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:18:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:18:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:18:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:18:22,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-08-05 10:18:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:22,640 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:18:22,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:18:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:18:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:18:22,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:22,641 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-08-05 10:18:22,641 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:22,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:22,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-08-05 10:18:22,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:22,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:18:22,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:18:23,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:23,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:18:23,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:18:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:18:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:18:23,006 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-08-05 10:18:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:23,466 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 10:18:23,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:18:23,466 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-05 10:18:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:23,467 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:18:23,467 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:18:23,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:18:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:18:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:18:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:18:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:18:23,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-05 10:18:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:23,471 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:18:23,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:18:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:18:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:18:23,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:23,476 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-08-05 10:18:23,477 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-08-05 10:18:23,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:23,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:18:23,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 10:18:23,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:23,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:18:23,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:18:23,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:18:23,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:18:23,947 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-08-05 10:18:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,029 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 10:18:24,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:18:24,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-05 10:18:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,031 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:18:24,031 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:18:24,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:18:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:18:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:18:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:18:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 10:18:24,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-08-05 10:18:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,036 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 10:18:24,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:18:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 10:18:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:18:24,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,037 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-08-05 10:18:24,038 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-08-05 10:18:24,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-08-05 10:18:24,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:24,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:18:24,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:18:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:18:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:18:24,252 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-08-05 10:18:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,344 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 10:18:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:18:24,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-05 10:18:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,345 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:18:24,345 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:18:24,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:18:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:18:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:18:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:18:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:18:24,350 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-08-05 10:18:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,350 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:18:24,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:18:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:18:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:18:24,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,352 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-08-05 10:18:24,352 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-08-05 10:18:24,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 10:18:24,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:24,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:18:24,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:18:24,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:18:24,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:18:24,617 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-08-05 10:18:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,681 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 10:18:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:18:24,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-05 10:18:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,683 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:18:24,683 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:18:24,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 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:18:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:18:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:18:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:18:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:18:24,688 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-05 10:18:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,688 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:18:24,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:18:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:18:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:18:24,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,690 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-08-05 10:18:24,690 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-08-05 10:18:24,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-08-05 10:18:25,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:18:25,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:18:25,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:18:25,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:18:25,024 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-08-05 10:18:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:25,104 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 10:18:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:18:25,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-05 10:18:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:25,106 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:18:25,106 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:18:25,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 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:18:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:18:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:18:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:18:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 10:18:25,111 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-08-05 10:18:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:25,112 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 10:18:25,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:18:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 10:18:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:18:25,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:25,113 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-08-05 10:18:25,114 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-08-05 10:18:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:25,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:18:25,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 10:18:25,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:25,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:18:25,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:18:25,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:18:25,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:18:25,648 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-08-05 10:18:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:25,738 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 10:18:25,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:18:25,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-05 10:18:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:25,740 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:18:25,740 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:18:25,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:18:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:18:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:18:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:18:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:18:25,745 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-08-05 10:18:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:25,746 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:18:25,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:18:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:18:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:18:25,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:25,747 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-08-05 10:18:25,748 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-08-05 10:18:25,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:25,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:18:25,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 10:18:26,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:26,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:18:26,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:18:26,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:18:26,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:18:26,100 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-08-05 10:18:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:26,244 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 10:18:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:18:26,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-05 10:18:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:26,245 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:18:26,245 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:18:26,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 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:18:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:18:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:18:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:18:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:18:26,250 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-05 10:18:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:26,251 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:18:26,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:18:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:18:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:18:26,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:26,252 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-08-05 10:18:26,252 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-08-05 10:18:26,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:26,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:18:26,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-08-05 10:18:26,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:26,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:18:26,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:18:26,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:18:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:18:26,678 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-08-05 10:18:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:26,757 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 10:18:26,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:18:26,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-05 10:18:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:26,758 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:18:26,758 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:18:26,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:18:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:18:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:18:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:18:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 10:18:26,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-08-05 10:18:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:26,764 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 10:18:26,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:18:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 10:18:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:18:26,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:26,765 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-08-05 10:18:26,765 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-08-05 10:18:26,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:26,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:18:26,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-08-05 10:18:27,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:27,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:18:27,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:18:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:18:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:18:27,021 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-08-05 10:18:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:27,217 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:18:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:18:27,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-05 10:18:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:27,218 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:18:27,218 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:18:27,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:18:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:18:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:18:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:18:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:18:27,223 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-08-05 10:18:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:27,224 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:18:27,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:18:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:18:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:18:27,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:27,227 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-08-05 10:18:27,227 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-08-05 10:18:27,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:27,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:18:27,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-08-05 10:18:27,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:27,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:18:27,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:18:27,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:18:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:18:27,548 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-08-05 10:18:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:27,671 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 10:18:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:18:27,672 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-05 10:18:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:27,672 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:18:27,673 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:18:27,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 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:18:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:18:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:18:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:18:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:18:27,678 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-05 10:18:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:27,679 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:18:27,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:18:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:18:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:18:27,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:27,680 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-08-05 10:18:27,680 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:27,681 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-08-05 10:18:27,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:27,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:18:27,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 10:18:28,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:28,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:18:28,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:18:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:18:28,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:18:28,246 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-08-05 10:18:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:28,323 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 10:18:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:18:28,323 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-05 10:18:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:28,324 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:18:28,325 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:18:28,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:18:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:18:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:18:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:18:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 10:18:28,329 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-08-05 10:18:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:28,330 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 10:18:28,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:18:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 10:18:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:18:28,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:28,331 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-08-05 10:18:28,331 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-08-05 10:18:28,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:28,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:18:28,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-08-05 10:18:29,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:29,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:18:29,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:18:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:18:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:18:29,422 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-08-05 10:18:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:29,558 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 10:18:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:18:29,561 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-05 10:18:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:29,562 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:18:29,562 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:18:29,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:18:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:18:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:18:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:18:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:18:29,565 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-08-05 10:18:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:29,566 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:18:29,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:18:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:18:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:18:29,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:29,567 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-08-05 10:18:29,567 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:29,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:29,567 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-08-05 10:18:29,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:29,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:18:29,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-08-05 10:18:29,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:29,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:18:29,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:18:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:18:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:18:29,968 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-08-05 10:18:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:30,068 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 10:18:30,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:18:30,070 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-05 10:18:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:30,070 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:18:30,071 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:18:30,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:18:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:18:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:18:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:18:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:18:30,075 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-05 10:18:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:30,075 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:18:30,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:18:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:18:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:18:30,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:30,076 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-08-05 10:18:30,076 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-08-05 10:18:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:30,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:18:30,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-08-05 10:18:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:30,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:18:30,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:18:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:18:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:18:30,835 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-08-05 10:18:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:30,940 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 10:18:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:18:30,941 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-05 10:18:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:30,942 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:18:30,942 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:18:30,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:18:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:18:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:18:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:18:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 10:18:30,946 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-08-05 10:18:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:30,946 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 10:18:30,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:18:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 10:18:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:18:30,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:30,947 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-08-05 10:18:30,948 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-08-05 10:18:30,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:30,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:18:30,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-08-05 10:18:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:31,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:18:31,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:18:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:18:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:18:31,585 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-08-05 10:18:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:31,688 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 10:18:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:18:31,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-05 10:18:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:31,689 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:18:31,689 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:18:31,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:18:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:18:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:18:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:18:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 10:18:31,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-08-05 10:18:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:31,694 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 10:18:31,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:18:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 10:18:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:18:31,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:31,695 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-08-05 10:18:31,695 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-08-05 10:18:31,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:31,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:18:31,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-08-05 10:18:32,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:32,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:18:32,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:18:32,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:18:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:18:32,283 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-08-05 10:18:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:32,365 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-05 10:18:32,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:18:32,365 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-05 10:18:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:32,366 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:18:32,366 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:18:32,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:18:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:18:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:18:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:18:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 10:18:32,370 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-05 10:18:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:32,371 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 10:18:32,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:18:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 10:18:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:18:32,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:32,372 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-08-05 10:18:32,372 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-08-05 10:18:32,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:32,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:18:32,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-08-05 10:18:33,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:33,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:18:33,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:18:33,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:18:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:18:33,279 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-08-05 10:18:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:33,376 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 10:18:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:18:33,376 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-05 10:18:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:33,377 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:18:33,377 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:18:33,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:18:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:18:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:18:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:18:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 10:18:33,380 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-08-05 10:18:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:33,380 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 10:18:33,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:18:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 10:18:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:18:33,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:33,381 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-08-05 10:18:33,381 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:33,382 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-08-05 10:18:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:33,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:18:33,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-08-05 10:18:33,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:33,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:18:33,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:18:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:18:33,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:18:33,859 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-08-05 10:18:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:34,064 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 10:18:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:18:34,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-05 10:18:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:34,065 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:18:34,065 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:18:34,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 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:18:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:18:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:18:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:18:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 10:18:34,069 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-08-05 10:18:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:34,069 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 10:18:34,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:18:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 10:18:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:18:34,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:34,070 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-08-05 10:18:34,070 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:34,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:34,070 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-08-05 10:18:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:34,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:18:34,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-08-05 10:18:34,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:18:34,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:18:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:18:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:18:34,469 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-08-05 10:18:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:34,585 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 10:18:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:18:34,586 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-05 10:18:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:34,587 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:18:34,587 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:18:34,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:18:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:18:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:18:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:18:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 10:18:34,591 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-05 10:18:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:34,592 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 10:18:34,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:18:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 10:18:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:18:34,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:34,593 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-08-05 10:18:34,593 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-08-05 10:18:34,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:34,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:18:34,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-08-05 10:18:35,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:35,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:18:35,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:18:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:18:35,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:18:35,033 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-08-05 10:18:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:35,140 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-05 10:18:35,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:18:35,141 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-05 10:18:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:35,142 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:18:35,142 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:18:35,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:18:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:18:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:18:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:18:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 10:18:35,144 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-08-05 10:18:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:35,144 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 10:18:35,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:18:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 10:18:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:18:35,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:35,145 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-08-05 10:18:35,145 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-08-05 10:18:35,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:35,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:18:35,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-08-05 10:18:35,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:35,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:18:35,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:18:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:18:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:35,577 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-08-05 10:18:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:35,733 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 10:18:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:18:35,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-05 10:18:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:35,735 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:18:35,735 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:18:35,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:18:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:18:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:18:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:18:35,739 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-08-05 10:18:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:35,740 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:18:35,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:18:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:18:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:18:35,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:35,741 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-08-05 10:18:35,741 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-08-05 10:18:35,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:35,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:18:35,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-08-05 10:18:36,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:36,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:18:36,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:18:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:18:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:36,230 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-08-05 10:18:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:36,374 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-08-05 10:18:36,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:18:36,381 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-05 10:18:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:36,381 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:18:36,381 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:18:36,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:18:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:18:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:18:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 10:18:36,384 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-05 10:18:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:36,384 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 10:18:36,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:18:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 10:18:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:18:36,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:36,385 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-08-05 10:18:36,385 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-08-05 10:18:36,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:36,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:18:36,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-08-05 10:18:36,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:36,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:18:36,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:18:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:18:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:36,918 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-08-05 10:18:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,026 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 10:18:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:18:37,027 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-05 10:18:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,027 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:18:37,028 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:18:37,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 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:18:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:18:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:18:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:18:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 10:18:37,031 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-08-05 10:18:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,031 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 10:18:37,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:18:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 10:18:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:18:37,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:37,032 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-08-05 10:18:37,033 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:37,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-08-05 10:18:37,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:37,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:18:37,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-08-05 10:18:37,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:37,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:18:37,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:18:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:18:37,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:37,654 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-08-05 10:18:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,788 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 10:18:37,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:18:37,788 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-05 10:18:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,789 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:18:37,790 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:18:37,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:18:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:18:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:18:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 10:18:37,793 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-08-05 10:18:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,794 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 10:18:37,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:18:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 10:18:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:18:37,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:37,795 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-08-05 10:18:37,795 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-08-05 10:18:37,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:37,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:18:37,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-08-05 10:18:38,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:38,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:18:38,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:18:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:18:38,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:38,674 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-08-05 10:18:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:38,883 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-05 10:18:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:18:38,883 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-05 10:18:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:38,884 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:18:38,884 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:18:38,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:18:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:18:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:18:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:18:38,888 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-05 10:18:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:38,888 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:18:38,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:18:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:18:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:18:38,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:38,889 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-08-05 10:18:38,889 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-08-05 10:18:38,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:38,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:18:38,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-08-05 10:18:39,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:39,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:18:39,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:18:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:18:39,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:39,708 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-08-05 10:18:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:40,188 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-05 10:18:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:18:40,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-05 10:18:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:40,190 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:18:40,190 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:18:40,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:18:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:18:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:18:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 10:18:40,193 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-08-05 10:18:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:40,193 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 10:18:40,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:18:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 10:18:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:18:40,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:40,194 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-08-05 10:18:40,195 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-08-05 10:18:40,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:40,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:18:40,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-08-05 10:18:40,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:40,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:18:40,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:18:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:18:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:40,894 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-08-05 10:18:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:41,023 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 10:18:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:18:41,024 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-05 10:18:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:41,025 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:18:41,025 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:18:41,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:18:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:18:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:18:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 10:18:41,029 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-08-05 10:18:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:41,029 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 10:18:41,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:18:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 10:18:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:18:41,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:41,030 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-08-05 10:18:41,030 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:41,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-08-05 10:18:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:41,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:18:41,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-08-05 10:18:41,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:41,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:18:41,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:18:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:18:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:41,690 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-08-05 10:18:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:41,817 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-08-05 10:18:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:18:41,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-05 10:18:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:41,818 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:18:41,818 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:18:41,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 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:18:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:18:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:18:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:18:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 10:18:41,822 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-05 10:18:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:41,822 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 10:18:41,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:18:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 10:18:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:18:41,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:41,823 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-08-05 10:18:41,823 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:41,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-08-05 10:18:41,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:41,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:18:41,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-08-05 10:18:43,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:43,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:18:43,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:18:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:18:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:43,055 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-08-05 10:18:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:43,213 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:18:43,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:18:43,213 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-05 10:18:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:43,213 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:18:43,214 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:18:43,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:18:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:18:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:18:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 10:18:43,216 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-08-05 10:18:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:43,216 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 10:18:43,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:18:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 10:18:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:18:43,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:43,217 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-08-05 10:18:43,217 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-08-05 10:18:43,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:43,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:18:43,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-08-05 10:18:44,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:44,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:18:44,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:18:44,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:18:44,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:44,123 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-08-05 10:18:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:44,295 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 10:18:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:18:44,295 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-05 10:18:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:44,296 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:18:44,297 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:18:44,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:18:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:18:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:18:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 10:18:44,300 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-08-05 10:18:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:44,301 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 10:18:44,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:18:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 10:18:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:18:44,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:44,302 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-08-05 10:18:44,302 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:44,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-08-05 10:18:44,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:44,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:18:44,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-08-05 10:18:45,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:45,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:18:45,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:18:45,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:18:45,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:18:45,028 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-08-05 10:18:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:45,224 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-05 10:18:45,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:18:45,224 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-05 10:18:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:45,225 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:18:45,225 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:18:45,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:18:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:18:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:18:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:18:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 10:18:45,229 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-05 10:18:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:45,229 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 10:18:45,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:18:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 10:18:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:18:45,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:45,230 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-08-05 10:18:45,230 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-08-05 10:18:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:45,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:18:45,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-08-05 10:18:46,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:46,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:18:46,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:18:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:18:46,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:18:46,051 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-08-05 10:18:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:46,195 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-05 10:18:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:18:46,196 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-05 10:18:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:46,196 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:18:46,197 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:18:46,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 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:18:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:18:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:18:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:18:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 10:18:46,200 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-08-05 10:18:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:46,201 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 10:18:46,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:18:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 10:18:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:18:46,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:46,201 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-08-05 10:18:46,202 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-08-05 10:18:46,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:46,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:18:46,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-08-05 10:18:47,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:47,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:18:47,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:18:47,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:18:47,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:18:47,436 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-08-05 10:18:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:47,592 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 10:18:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:18:47,592 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-08-05 10:18:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:47,593 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:18:47,594 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:18:47,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:18:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:18:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:18:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:18:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:18:47,597 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-08-05 10:18:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:47,597 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:18:47,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:18:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:18:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:18:47,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:47,598 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-08-05 10:18:47,598 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-08-05 10:18:47,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:47,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:18:47,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-08-05 10:18:48,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:48,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:18:48,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:18:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:18:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:18:48,533 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-08-05 10:18:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:48,711 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-05 10:18:48,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:18:48,711 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-08-05 10:18:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:48,712 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:18:48,712 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:18:48,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:18:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:18:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:18:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:18:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 10:18:48,715 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-05 10:18:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:48,716 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 10:18:48,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:18:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 10:18:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:18:48,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:48,716 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-08-05 10:18:48,717 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:48,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-08-05 10:18:48,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:48,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:18:48,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-08-05 10:18:49,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:49,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:18:49,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:18:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:18:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:18:49,571 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-08-05 10:18:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:49,980 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 10:18:49,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:18:49,981 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-08-05 10:18:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:49,982 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:18:49,982 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:18:49,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:18:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:18:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:18:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:18:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 10:18:49,986 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-08-05 10:18:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:49,986 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 10:18:49,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:18:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 10:18:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:18:49,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:49,987 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-08-05 10:18:49,987 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-08-05 10:18:49,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:50,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:18:50,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-08-05 10:18:51,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:51,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:18:51,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:18:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:18:51,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:18:51,098 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-08-05 10:18:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:51,262 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 10:18:51,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:18:51,263 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-08-05 10:18:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:51,264 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:18:51,264 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:18:51,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:18:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:18:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:18:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:18:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 10:18:51,267 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-08-05 10:18:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:51,268 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 10:18:51,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:18:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 10:18:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:18:51,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:51,269 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-08-05 10:18:51,269 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-08-05 10:18:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:51,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:18:51,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-08-05 10:18:52,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:52,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:18:52,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:18:52,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:18:52,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:18:52,629 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-08-05 10:18:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:52,801 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 10:18:52,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:18:52,802 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-08-05 10:18:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:52,803 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:18:52,803 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:18:52,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:18:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:18:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:18:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:18:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:18:52,806 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-05 10:18:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:52,806 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:18:52,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:18:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:18:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:18:52,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:52,807 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-08-05 10:18:52,807 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:52,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:52,807 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-08-05 10:18:52,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:52,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:18:52,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-08-05 10:18:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:54,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:18:54,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:18:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:18:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:54,128 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-08-05 10:18:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:54,312 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-05 10:18:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:18:54,312 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-08-05 10:18:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:54,313 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:18:54,314 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:18:54,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:18:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:18:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:18:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-05 10:18:54,317 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-08-05 10:18:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:54,318 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-05 10:18:54,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:18:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-05 10:18:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:18:54,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:54,319 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-08-05 10:18:54,319 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-08-05 10:18:54,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:54,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:18:54,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-08-05 10:18:55,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:55,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:18:55,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:18:55,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:18:55,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:18:55,287 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-08-05 10:18:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:55,507 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:18:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:18:55,508 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-08-05 10:18:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:55,508 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:18:55,509 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:18:55,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 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:18:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:18:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:18:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:18:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 10:18:55,513 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-08-05 10:18:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:55,513 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 10:18:55,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:18:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 10:18:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:18:55,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:55,514 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-08-05 10:18:55,514 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-08-05 10:18:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:55,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:18:55,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-08-05 10:18:57,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:57,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:18:57,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:18:57,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:18:57,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:18:57,021 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-08-05 10:18:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:57,407 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-08-05 10:18:57,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:18:57,408 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-08-05 10:18:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:57,409 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:18:57,409 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:18:57,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:18:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:18:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:18:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:18:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 10:18:57,414 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-05 10:18:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:57,414 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 10:18:57,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:18:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 10:18:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:18:57,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:57,416 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-08-05 10:18:57,416 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-08-05 10:18:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:57,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:18:57,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-08-05 10:18:59,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:59,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:18:59,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:18:59,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:18:59,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:59,213 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-08-05 10:18:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:59,395 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 10:18:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:18:59,395 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-08-05 10:18:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:59,396 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:18:59,397 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:18:59,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:18:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:18:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:18:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 10:18:59,400 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-08-05 10:18:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:59,401 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 10:18:59,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:18:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 10:18:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:18:59,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:59,402 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-08-05 10:18:59,402 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-08-05 10:18:59,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:59,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:18:59,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-08-05 10:19:00,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:00,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:19:00,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:19:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:19:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:19:00,798 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-08-05 10:19:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:01,037 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-05 10:19:01,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:19:01,037 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-08-05 10:19:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:01,038 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:19:01,038 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:19:01,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:19:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:19:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:19:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:19:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 10:19:01,042 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-08-05 10:19:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:01,042 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 10:19:01,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:19:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 10:19:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:19:01,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:01,043 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-08-05 10:19:01,043 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-08-05 10:19:01,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:01,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:19:01,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-08-05 10:19:02,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:02,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:19:02,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:19:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:19:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:19:02,109 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-08-05 10:19:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:02,295 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-08-05 10:19:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:19:02,296 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-08-05 10:19:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:02,297 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:19:02,297 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:19:02,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 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:19:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:19:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:19:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:19:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 10:19:02,301 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-05 10:19:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:02,301 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 10:19:02,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:19:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 10:19:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:19:02,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:02,302 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-08-05 10:19:02,302 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-08-05 10:19:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:02,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:19:02,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-08-05 10:19:03,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:03,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:19:03,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:19:03,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:19:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:19:03,643 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-08-05 10:19:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:04,000 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-05 10:19:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:19:04,000 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-08-05 10:19:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:04,001 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:19:04,001 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:19:04,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:19:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:19:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:19:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:19:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-05 10:19:04,004 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-08-05 10:19:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:04,004 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-05 10:19:04,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:19:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-05 10:19:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:19:04,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:04,005 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-08-05 10:19:04,005 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-08-05 10:19:04,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:04,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:19:04,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-08-05 10:19:05,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:05,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:19:05,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:19:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:19:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:19:05,401 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-08-05 10:19:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:06,486 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-05 10:19:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:19:06,487 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-08-05 10:19:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:06,487 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:19:06,488 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:19:06,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:19:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:19:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:19:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:19:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 10:19:06,490 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-08-05 10:19:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:06,490 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 10:19:06,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:19:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 10:19:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:19:06,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:06,491 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-08-05 10:19:06,491 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-08-05 10:19:06,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:06,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:19:06,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-08-05 10:19:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:19:08,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:19:08,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:19:08,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:19:08,474 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-08-05 10:19:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:08,683 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-08-05 10:19:08,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:19:08,683 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-08-05 10:19:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:08,684 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:19:08,684 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:19:08,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:19:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:19:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:19:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:19:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-05 10:19:08,688 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-05 10:19:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:08,688 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-05 10:19:08,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:19:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-05 10:19:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:19:08,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,689 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-08-05 10:19:08,689 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-08-05 10:19:08,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-08-05 10:19:10,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:19:10,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:19:10,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:19:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:19:10,175 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-08-05 10:19:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:10,379 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-05 10:19:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:19:10,379 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-08-05 10:19:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:10,380 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:19:10,380 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:19:10,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:19:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:19:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:19:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:19:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-08-05 10:19:10,384 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-08-05 10:19:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:10,384 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-08-05 10:19:10,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:19:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-08-05 10:19:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:19:10,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:10,385 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-08-05 10:19:10,385 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:10,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-08-05 10:19:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:10,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:19:10,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-08-05 10:19:11,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:11,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:19:11,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:19:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:19:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:19:11,763 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-08-05 10:19:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:11,983 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-05 10:19:11,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:19:11,984 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-08-05 10:19:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:11,985 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:19:11,985 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:19:11,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:19:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:19:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:19:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:19:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-05 10:19:11,988 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-08-05 10:19:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:11,988 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-05 10:19:11,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:19:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-05 10:19:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:19:11,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:11,990 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-08-05 10:19:11,990 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-08-05 10:19:11,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:12,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:19:12,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-08-05 10:19:13,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:13,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:19:13,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:19:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:19:13,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:19:13,443 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-08-05 10:19:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:13,754 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-05 10:19:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:19:13,754 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-08-05 10:19:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:13,755 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:19:13,755 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:19:13,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:19:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:19:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:19:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:19:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 10:19:13,758 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-05 10:19:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:13,758 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 10:19:13,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:19:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 10:19:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:19:13,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:13,760 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-08-05 10:19:13,760 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:13,760 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-08-05 10:19:13,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:13,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:19:13,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-08-05 10:19:15,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:15,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:19:15,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:19:15,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:19:15,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:19:15,397 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-08-05 10:19:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:15,632 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-08-05 10:19:15,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:19:15,632 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-08-05 10:19:15,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:15,634 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:19:15,634 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:19:15,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:19:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:19:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:19:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:19:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-08-05 10:19:15,637 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-08-05 10:19:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:15,638 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-08-05 10:19:15,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:19:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-08-05 10:19:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:19:15,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:15,639 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-08-05 10:19:15,639 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-08-05 10:19:15,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:15,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:19:15,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-08-05 10:19:17,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:17,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:19:17,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:19:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:19:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:19:17,166 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-08-05 10:19:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:17,387 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 10:19:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:19:17,387 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-08-05 10:19:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:17,389 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:19:17,389 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:19:17,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 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:19:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:19:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:19:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:19:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-05 10:19:17,392 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-08-05 10:19:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:17,392 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-05 10:19:17,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:19:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-05 10:19:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:19:17,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:17,393 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-08-05 10:19:17,393 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-08-05 10:19:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:17,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:19:17,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-08-05 10:19:18,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:18,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:19:18,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:19:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:19:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:19:18,830 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-08-05 10:19:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:19,170 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2019-08-05 10:19:19,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:19:19,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-08-05 10:19:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:19,171 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:19:19,171 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:19:19,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 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:19:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:19:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 10:19:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:19:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-05 10:19:19,173 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-05 10:19:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:19,173 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-05 10:19:19,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:19:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-05 10:19:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:19:19,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:19,174 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-08-05 10:19:19,174 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-08-05 10:19:19,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:19,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:19:19,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-08-05 10:19:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:20,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:19:20,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:19:20,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:19:20,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:19:20,974 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-08-05 10:19:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:21,222 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-05 10:19:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:19:21,222 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-08-05 10:19:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:21,223 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:19:21,223 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:19:21,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:19:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:19:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:19:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:19:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-05 10:19:21,227 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-08-05 10:19:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:21,228 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-05 10:19:21,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:19:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-05 10:19:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:19:21,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:21,229 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-08-05 10:19:21,229 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-08-05 10:19:21,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:21,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:19:21,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-08-05 10:19:22,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:22,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:19:22,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:19:22,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:19:22,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:22,767 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-08-05 10:19:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:23,015 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 10:19:23,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:19:23,015 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-08-05 10:19:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:23,016 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:19:23,016 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:19:23,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:19:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:19:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:19:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-05 10:19:23,020 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-08-05 10:19:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:23,020 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-05 10:19:23,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:19:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-05 10:19:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:19:23,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:23,021 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-08-05 10:19:23,021 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-08-05 10:19:23,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:23,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:19:23,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-08-05 10:19:24,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:24,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:19:24,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:19:24,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:19:24,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:24,991 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-08-05 10:19:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:25,633 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-08-05 10:19:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:19:25,633 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-08-05 10:19:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:25,634 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:19:25,634 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:19:25,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:19:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 10:19:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:19:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-05 10:19:25,637 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-05 10:19:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:25,638 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-05 10:19:25,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:19:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-05 10:19:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:19:25,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:25,638 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-08-05 10:19:25,639 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:25,639 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-08-05 10:19:25,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:25,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:19:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-08-05 10:19:27,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:27,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:19:27,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:19:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:19:27,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:27,383 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-08-05 10:19:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:27,641 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-08-05 10:19:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:19:27,642 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-08-05 10:19:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:27,643 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:19:27,643 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:19:27,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:19:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 10:19:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:19:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-08-05 10:19:27,648 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-08-05 10:19:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:27,648 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-08-05 10:19:27,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:19:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-08-05 10:19:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:19:27,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:27,649 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-08-05 10:19:27,649 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-08-05 10:19:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:27,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:19:27,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-08-05 10:19:29,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:29,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:19:29,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:19:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:19:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:29,608 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-08-05 10:19:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:29,981 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-05 10:19:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:19:29,982 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-08-05 10:19:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:29,982 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:19:29,982 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:19:29,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:19:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:19:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:19:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 10:19:29,984 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-08-05 10:19:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:29,985 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 10:19:29,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:19:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 10:19:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:19:29,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:29,986 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-08-05 10:19:29,986 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-08-05 10:19:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:30,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:19:30,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-08-05 10:19:31,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:19:31,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:19:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:19:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:19:31,758 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-08-05 10:19:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:32,122 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-08-05 10:19:32,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:19:32,123 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-08-05 10:19:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:32,123 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:19:32,124 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:19:32,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:19:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:19:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:19:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:19:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-05 10:19:32,126 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-05 10:19:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:32,126 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-05 10:19:32,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:19:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-05 10:19:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:19:32,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:32,127 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-08-05 10:19:32,128 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-08-05 10:19:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:19:32,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-08-05 10:19:33,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:33,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:19:33,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:19:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:19:33,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:19:33,985 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-08-05 10:19:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:34,298 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 10:19:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:19:34,299 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-08-05 10:19:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:34,300 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:19:34,300 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:19:34,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:19:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:19:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 10:19:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:19:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-08-05 10:19:34,303 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-08-05 10:19:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:34,303 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-08-05 10:19:34,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:19:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-08-05 10:19:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:19:34,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:34,304 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-08-05 10:19:34,305 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:34,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:34,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-08-05 10:19:34,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:34,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:19:34,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-08-05 10:19:36,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:36,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:19:36,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:19:36,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:19:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:19:36,337 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-08-05 10:19:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:36,663 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-05 10:19:36,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:19:36,663 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-08-05 10:19:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:36,664 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:19:36,664 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:19:36,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 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:19:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:19:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 10:19:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:19:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-05 10:19:36,666 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-08-05 10:19:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:36,667 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-05 10:19:36,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:19:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-05 10:19:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:19:36,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:36,668 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-08-05 10:19:36,668 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-08-05 10:19:36,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:36,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:19:36,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-08-05 10:19:38,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:38,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:19:38,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:19:38,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:19:38,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:19:38,440 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-08-05 10:19:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:38,758 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-08-05 10:19:38,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:19:38,758 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-08-05 10:19:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:38,759 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:19:38,760 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:19:38,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:19:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:19:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-05 10:19:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:19:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-05 10:19:38,764 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-05 10:19:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:38,764 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-05 10:19:38,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:19:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-05 10:19:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:19:38,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:38,765 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-08-05 10:19:38,765 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-08-05 10:19:38,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:38,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:19:38,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-08-05 10:19:41,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:41,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:19:41,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:19:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:19:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:19:41,166 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-08-05 10:19:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:41,526 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-08-05 10:19:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:19:41,526 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-08-05 10:19:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:41,527 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:19:41,528 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:19:41,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:19:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:19:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:19:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:19:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-08-05 10:19:41,531 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-08-05 10:19:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:41,531 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-08-05 10:19:41,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:19:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-08-05 10:19:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:19:41,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:41,533 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-08-05 10:19:41,533 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-08-05 10:19:41,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:41,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:19:41,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-08-05 10:19:43,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:43,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:19:43,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:19:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:19:43,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:19:43,533 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-08-05 10:19:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:43,888 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-05 10:19:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:19:43,893 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-08-05 10:19:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:43,893 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:19:43,893 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:19:43,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 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:19:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:19:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:19:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:19:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-05 10:19:43,896 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-08-05 10:19:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:43,896 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-05 10:19:43,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:19:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-05 10:19:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:19:43,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:43,898 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-08-05 10:19:43,898 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:43,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:43,898 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-08-05 10:19:43,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:43,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:19:43,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-08-05 10:19:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:46,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:19:46,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:19:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:19:46,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:19:46,370 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-08-05 10:19:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:46,803 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-08-05 10:19:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:19:46,803 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-08-05 10:19:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:46,804 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:19:46,804 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:19:46,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:19:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:19:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-08-05 10:19:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:19:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-05 10:19:46,808 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-08-05 10:19:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:46,808 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-05 10:19:46,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:19:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-05 10:19:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:19:46,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:46,809 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-08-05 10:19:46,809 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-08-05 10:19:46,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:46,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:19:46,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-08-05 10:19:49,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:49,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:19:49,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:19:49,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:19:49,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:19:49,210 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-08-05 10:19:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:49,584 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-05 10:19:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:19:49,585 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-08-05 10:19:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:49,586 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:19:49,586 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:19:49,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:19:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:19:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 10:19:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:19:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-08-05 10:19:49,589 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-08-05 10:19:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:49,590 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-08-05 10:19:49,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:19:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-08-05 10:19:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:19:49,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:49,591 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-08-05 10:19:49,591 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:49,592 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-08-05 10:19:49,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:49,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:19:49,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-08-05 10:19:51,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:51,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:19:51,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:19:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:19:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:19:51,936 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-08-05 10:19:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:52,315 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-05 10:19:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:19:52,315 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-08-05 10:19:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:52,317 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:19:52,317 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:19:52,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 77 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:19:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:19:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 10:19:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:19:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-05 10:19:52,320 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-08-05 10:19:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:52,320 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-05 10:19:52,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:19:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-05 10:19:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:19:52,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:52,321 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-08-05 10:19:52,321 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-08-05 10:19:52,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:52,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:19:52,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-08-05 10:19:54,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:54,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:19:54,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:19:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:19:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:19:54,377 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-08-05 10:19:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:54,775 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-08-05 10:19:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:19:54,776 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-08-05 10:19:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:54,777 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:19:54,777 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:19:54,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:19:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:19:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-05 10:19:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:19:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-05 10:19:54,779 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-08-05 10:19:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:54,780 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-05 10:19:54,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:19:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-05 10:19:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:19:54,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:54,781 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-08-05 10:19:54,781 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:54,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-08-05 10:19:54,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:54,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:19:54,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-08-05 10:19:57,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:57,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:19:57,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:19:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:19:57,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:19:57,217 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-08-05 10:19:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:57,634 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-08-05 10:19:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:19:57,634 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-08-05 10:19:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:57,635 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:19:57,635 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:19:57,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:19:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:19:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-05 10:19:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:19:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-08-05 10:19:57,639 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-08-05 10:19:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:57,639 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-08-05 10:19:57,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:19:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-08-05 10:19:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:19:57,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:57,640 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-08-05 10:19:57,640 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-08-05 10:19:57,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:57,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:19:57,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-08-05 10:19:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:19:59,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:19:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:19:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:19:59,790 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-08-05 10:20:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:00,475 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-05 10:20:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:20:00,476 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-08-05 10:20:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:00,477 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:20:00,477 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:20:00,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:20:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:20:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-05 10:20:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:20:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-05 10:20:00,480 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-08-05 10:20:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:00,480 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-05 10:20:00,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:20:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-05 10:20:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:20:00,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:00,482 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-08-05 10:20:00,482 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-08-05 10:20:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:00,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:20:00,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-08-05 10:20:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:02,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:20:02,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:20:02,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:20:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:20:02,743 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-08-05 10:20:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:03,186 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-08-05 10:20:03,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:20:03,186 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-08-05 10:20:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:03,187 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:20:03,187 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:20:03,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:20:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:20:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-08-05 10:20:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:20:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-08-05 10:20:03,191 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-08-05 10:20:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:03,191 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-08-05 10:20:03,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:20:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-08-05 10:20:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:20:03,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:03,192 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-08-05 10:20:03,193 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:03,193 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-08-05 10:20:03,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:03,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:20:03,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-08-05 10:20:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:05,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:20:05,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:20:05,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:20:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:20:05,870 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-08-05 10:20:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:06,343 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-08-05 10:20:06,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:20:06,344 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-08-05 10:20:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:06,344 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:20:06,345 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:20:06,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:20:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:20:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-05 10:20:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 10:20:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-08-05 10:20:06,347 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-08-05 10:20:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:06,347 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-08-05 10:20:06,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:20:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-08-05 10:20:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:20:06,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:06,348 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-08-05 10:20:06,348 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-08-05 10:20:06,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:06,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:20:06,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-08-05 10:20:08,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:08,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:20:08,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:20:08,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:20:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:20:08,710 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-08-05 10:20:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:09,179 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-08-05 10:20:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:20:09,179 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-08-05 10:20:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:09,180 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:20:09,180 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:20:09,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:20:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:20:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-05 10:20:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:20:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-08-05 10:20:09,183 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-08-05 10:20:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:09,183 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-08-05 10:20:09,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:20:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-08-05 10:20:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:20:09,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:09,184 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-08-05 10:20:09,184 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-08-05 10:20:09,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:09,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:20:09,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-08-05 10:20:11,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:11,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:20:11,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:20:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:20:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:20:11,877 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-08-05 10:20:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:12,377 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-08-05 10:20:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:20:12,377 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-08-05 10:20:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:12,378 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:20:12,378 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:20:12,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:20:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:20:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-08-05 10:20:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:20:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-08-05 10:20:12,382 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-08-05 10:20:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:12,382 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-08-05 10:20:12,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:20:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-08-05 10:20:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-05 10:20:12,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:12,383 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-08-05 10:20:12,383 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-08-05 10:20:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:12,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:20:12,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-08-05 10:20:14,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:14,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:20:14,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:20:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:20:14,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:20:14,905 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-08-05 10:20:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:15,487 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-08-05 10:20:15,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:20:15,488 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-08-05 10:20:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:15,489 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:20:15,489 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:20:15,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:20:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:20:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-05 10:20:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:20:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-08-05 10:20:15,492 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-08-05 10:20:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:15,492 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-08-05 10:20:15,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:20:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-08-05 10:20:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:20:15,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:15,494 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-08-05 10:20:15,494 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-08-05 10:20:15,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:15,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:20:15,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-08-05 10:20:18,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:18,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:20:18,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:20:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:20:18,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:20:18,242 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-08-05 10:20:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:18,828 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-08-05 10:20:18,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:20:18,828 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-08-05 10:20:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:18,829 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:20:18,829 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:20:18,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:20:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:20:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-08-05 10:20:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:20:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-08-05 10:20:18,833 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-08-05 10:20:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:18,833 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-08-05 10:20:18,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:20:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-08-05 10:20:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:20:18,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:18,834 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-08-05 10:20:18,834 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-08-05 10:20:18,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:18,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:20:18,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-08-05 10:20:21,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:21,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:20:21,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:20:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:20:21,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:20:21,709 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-08-05 10:20:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:22,269 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-08-05 10:20:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:20:22,270 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-08-05 10:20:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:22,271 INFO L225 Difference]: With dead ends: 177 [2019-08-05 10:20:22,271 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 10:20:22,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:20:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 10:20:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-08-05 10:20:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:20:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-08-05 10:20:22,274 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-08-05 10:20:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:22,275 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-08-05 10:20:22,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:20:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-08-05 10:20:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 10:20:22,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:22,276 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-08-05 10:20:22,276 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-08-05 10:20:22,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:22,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:20:22,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-08-05 10:20:24,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:24,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:20:24,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:20:24,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:20:24,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:20:24,957 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-08-05 10:20:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:25,516 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-08-05 10:20:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:20:25,516 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-08-05 10:20:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:25,517 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:20:25,517 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:20:25,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 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:20:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:20:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-05 10:20:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-05 10:20:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-08-05 10:20:25,519 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-08-05 10:20:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:25,520 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-08-05 10:20:25,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:20:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-08-05 10:20:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:20:25,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:25,520 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-08-05 10:20:25,521 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-08-05 10:20:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:25,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:20:25,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-08-05 10:20:28,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:28,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:20:28,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:20:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:20:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:20:28,623 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-08-05 10:20:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:29,221 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-08-05 10:20:29,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:20:29,221 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-08-05 10:20:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:29,223 INFO L225 Difference]: With dead ends: 181 [2019-08-05 10:20:29,223 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:20:29,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:20:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:20:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-08-05 10:20:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-05 10:20:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-08-05 10:20:29,226 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-08-05 10:20:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:29,227 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-08-05 10:20:29,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:20:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-08-05 10:20:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:20:29,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:29,228 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-08-05 10:20:29,228 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-08-05 10:20:29,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:29,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:20:29,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-08-05 10:20:32,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:32,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:20:32,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:20:32,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:20:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:20:32,259 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-08-05 10:20:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:32,847 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-05 10:20:32,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:20:32,847 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-08-05 10:20:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:32,849 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:20:32,849 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:20:32,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 90 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:20:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:20:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-08-05 10:20:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:20:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-08-05 10:20:32,852 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-08-05 10:20:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:32,852 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-08-05 10:20:32,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:20:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-08-05 10:20:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-08-05 10:20:32,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:32,853 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-08-05 10:20:32,853 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-08-05 10:20:32,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:32,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:20:32,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-08-05 10:20:35,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:35,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:20:35,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:20:35,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:20:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:20:35,705 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-08-05 10:20:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:36,563 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-08-05 10:20:36,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:20:36,563 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-08-05 10:20:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:36,564 INFO L225 Difference]: With dead ends: 185 [2019-08-05 10:20:36,564 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 10:20:36,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:20:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 10:20:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-08-05 10:20:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:20:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-08-05 10:20:36,567 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-08-05 10:20:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:36,567 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-08-05 10:20:36,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:20:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-08-05 10:20:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 10:20:36,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:36,569 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-08-05 10:20:36,569 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:36,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:36,569 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-08-05 10:20:36,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:36,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:20:36,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-08-05 10:20:39,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:39,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:20:39,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:20:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:20:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:20:39,398 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-08-05 10:20:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:40,068 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-08-05 10:20:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:20:40,069 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-08-05 10:20:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:40,070 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:20:40,070 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:20:40,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:20:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:20:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-08-05 10:20:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 10:20:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-08-05 10:20:40,074 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-08-05 10:20:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:40,074 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-08-05 10:20:40,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:20:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-08-05 10:20:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-05 10:20:40,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:40,075 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-08-05 10:20:40,075 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-08-05 10:20:40,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:40,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:20:40,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-08-05 10:20:43,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:43,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:20:43,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:20:43,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:20:43,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:20:43,399 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-08-05 10:20:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:44,051 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-08-05 10:20:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:20:44,051 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-08-05 10:20:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:44,053 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:20:44,053 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:20:44,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:20:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:20:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-08-05 10:20:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 10:20:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-08-05 10:20:44,056 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-08-05 10:20:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:44,057 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-08-05 10:20:44,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:20:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-08-05 10:20:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:20:44,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:44,058 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-08-05 10:20:44,058 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-08-05 10:20:44,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:44,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:20:44,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-08-05 10:20:47,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:47,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:20:47,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:20:47,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:20:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:20:47,369 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-08-05 10:20:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:48,055 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-08-05 10:20:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:20:48,056 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-08-05 10:20:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:48,057 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:20:48,057 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:20:48,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:20:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:20:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-08-05 10:20:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-08-05 10:20:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-08-05 10:20:48,061 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-08-05 10:20:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:48,061 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-08-05 10:20:48,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:20:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-08-05 10:20:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-05 10:20:48,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:48,062 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-08-05 10:20:48,063 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:48,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-08-05 10:20:48,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:48,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:20:48,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-08-05 10:20:51,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:51,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:20:51,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:20:51,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:20:51,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:20:51,295 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-08-05 10:20:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:52,131 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-08-05 10:20:52,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:20:52,132 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-08-05 10:20:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:52,133 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:20:52,133 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 10:20:52,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:20:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 10:20:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-08-05 10:20:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:20:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-08-05 10:20:52,136 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-08-05 10:20:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:52,136 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-08-05 10:20:52,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:20:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-08-05 10:20:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 10:20:52,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:52,137 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-08-05 10:20:52,137 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-08-05 10:20:52,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:52,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:20:52,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-08-05 10:20:55,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:55,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:20:55,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:20:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:20:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:20:55,800 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-08-05 10:20:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:56,693 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-08-05 10:20:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:20:56,693 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-08-05 10:20:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:56,694 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:20:56,694 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:20:56,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:20:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:20:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-08-05 10:20:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-05 10:20:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-08-05 10:20:56,697 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-08-05 10:20:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:56,697 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-08-05 10:20:56,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:20:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-08-05 10:20:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:20:56,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:56,698 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-08-05 10:20:56,698 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-08-05 10:20:56,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:56,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:20:56,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-08-05 10:20:59,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:59,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:20:59,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:20:59,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:20:59,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:20:59,957 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-08-05 10:21:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:00,685 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-08-05 10:21:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:21:00,685 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-08-05 10:21:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:00,686 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:21:00,686 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 10:21:00,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:21:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 10:21:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-05 10:21:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:21:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-08-05 10:21:00,690 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-08-05 10:21:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:00,691 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-08-05 10:21:00,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:21:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-08-05 10:21:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:21:00,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:00,692 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-08-05 10:21:00,692 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:00,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:00,692 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-08-05 10:21:00,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:00,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:21:00,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-08-05 10:21:04,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:04,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:21:04,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:21:04,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:21:04,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:21:04,301 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-08-05 10:21:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:04,994 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-08-05 10:21:04,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:21:04,994 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-08-05 10:21:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:04,996 INFO L225 Difference]: With dead ends: 199 [2019-08-05 10:21:04,996 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 10:21:04,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:21:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 10:21:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-08-05 10:21:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 10:21:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-08-05 10:21:04,999 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-08-05 10:21:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:04,999 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-08-05 10:21:05,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:21:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-08-05 10:21:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-08-05 10:21:05,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:05,000 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-08-05 10:21:05,001 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:05,001 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-08-05 10:21:05,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:05,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:21:05,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-08-05 10:21:08,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:08,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:21:08,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:21:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:21:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:21:08,642 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-08-05 10:21:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:09,365 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-08-05 10:21:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:21:09,366 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-08-05 10:21:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:09,367 INFO L225 Difference]: With dead ends: 201 [2019-08-05 10:21:09,367 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:21:09,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:21:09,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:21:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-08-05 10:21:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-05 10:21:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-08-05 10:21:09,369 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-08-05 10:21:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:09,369 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-08-05 10:21:09,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:21:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-08-05 10:21:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:21:09,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:09,370 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-08-05 10:21:09,370 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-08-05 10:21:09,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:09,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:21:09,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-08-05 10:21:13,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:13,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:21:13,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:21:13,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:21:13,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:21:13,129 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-08-05 10:21:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:13,870 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-05 10:21:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:21:13,871 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-08-05 10:21:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:13,871 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:21:13,871 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:21:13,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 100 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:21:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:21:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-05 10:21:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:21:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-08-05 10:21:13,875 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-08-05 10:21:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:13,875 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-08-05 10:21:13,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:21:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-08-05 10:21:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-05 10:21:13,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:13,876 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-08-05 10:21:13,876 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-08-05 10:21:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:13,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:21:13,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-08-05 10:21:17,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:17,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:21:17,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:21:17,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:21:17,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:21:17,600 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-08-05 10:21:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:18,371 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-08-05 10:21:18,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:21:18,372 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-08-05 10:21:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:18,373 INFO L225 Difference]: With dead ends: 205 [2019-08-05 10:21:18,373 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 10:21:18,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 101 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:21:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 10:21:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-08-05 10:21:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 10:21:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-08-05 10:21:18,377 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-08-05 10:21:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:18,377 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-08-05 10:21:18,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:21:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-08-05 10:21:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:21:18,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:18,378 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-08-05 10:21:18,378 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-08-05 10:21:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:18,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:21:18,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-05 10:21:22,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:22,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:21:22,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:21:22,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:21:22,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:21:22,424 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-08-05 10:21:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:23,232 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-08-05 10:21:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:21:23,233 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-08-05 10:21:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:23,234 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:21:23,234 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:21:23,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:21:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:21:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-08-05 10:21:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-05 10:21:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-08-05 10:21:23,238 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-08-05 10:21:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:23,238 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-08-05 10:21:23,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:21:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-08-05 10:21:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:21:23,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:23,240 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-08-05 10:21:23,240 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-08-05 10:21:23,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:23,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:21:23,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-08-05 10:21:26,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:26,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:21:26,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:21:26,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:21:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:21:26,805 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-08-05 10:21:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:27,782 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-08-05 10:21:27,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:21:27,782 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-08-05 10:21:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:27,783 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:21:27,783 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 10:21:27,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:21:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 10:21:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-08-05 10:21:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-05 10:21:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-08-05 10:21:27,787 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-08-05 10:21:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:27,787 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-08-05 10:21:27,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:21:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-08-05 10:21:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:21:27,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,788 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-08-05 10:21:27,788 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-08-05 10:21:27,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:47,619 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.OutOfMemoryError: Java heap space at de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.resize(CuckooHashSet.java:110) at de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.add_internal(CuckooHashSet.java:146) at de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.add(CuckooHashSet.java:196) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.insertEqualityEntry(CClosure.java:154) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.createCCEquality(CClosure.java:188) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:190) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.Clausifier$CollectLiterals.perform(Clausifier.java:740) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.Clausifier.run(Clausifier.java:1669) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.Clausifier.addFormula(Clausifier.java:1733) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:644) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertConjunctsOfCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertConjunctsOfCodeBlocks.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertConjunctsOfCodeBlocks.annotateAndAssertConjuncts(AnnotateAndAssertConjunctsOfCodeBlocks.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertConjunctsOfCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertConjunctsOfCodeBlocks.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:293) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) [2019-08-05 10:21:47,625 INFO L168 Benchmark]: Toolchain (without parser) took 208739.59 ms. Allocated memory was 133.7 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 110.0 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2019-08-05 10:21:47,626 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:21:47,627 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.80 ms. Allocated memory is still 133.7 MB. Free memory was 109.6 MB in the beginning and 107.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:47,629 INFO L168 Benchmark]: Boogie Preprocessor took 22.81 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.0 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:21:47,630 INFO L168 Benchmark]: RCFGBuilder took 300.48 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 97.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:47,630 INFO L168 Benchmark]: TraceAbstraction took 208370.65 ms. Allocated memory was 133.7 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 96.7 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.3 GB. Max. memory is 7.1 GB. [2019-08-05 10:21:47,634 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.22 ms. Allocated memory is still 133.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.80 ms. Allocated memory is still 133.7 MB. Free memory was 109.6 MB in the beginning and 107.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.81 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.0 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 300.48 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 97.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208370.65 ms. Allocated memory was 133.7 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 96.7 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: OutOfMemoryError: Java heap space de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: OutOfMemoryError: Java heap space: de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.resize(CuckooHashSet.java:110) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...