java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:45:11,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:45:11,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:45:11,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:45:11,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:45:11,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:45:11,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:45:11,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:45:11,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:45:11,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:45:11,923 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:45:11,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:45:11,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:45:11,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:45:11,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:45:11,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:45:11,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:45:11,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:45:11,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:45:11,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:45:11,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:45:11,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:45:11,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:45:11,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:45:11,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:45:11,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:45:11,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:45:11,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:45:11,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:45:11,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:45:11,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:45:11,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:45:11,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:45:11,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:45:11,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:45:11,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:45:11,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:45:11,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:45:11,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:45:11,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:45:11,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:45:12,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:45:12,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:45:12,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:45:12,025 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:45:12,028 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:45:12,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:45:12,031 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:45:12,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:45:12,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:45:12,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:45:12,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:45:12,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:45:12,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:45:12,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:45:12,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:45:12,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:45:12,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/1) ... [2019-08-05 10:45:12,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:45:12,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:45:12,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:45:12,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:45:12,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (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:45:12,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:45:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:45:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:45:12,385 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:45:12,386 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:45:12,387 INFO L202 PluginConnector]: Adding new model jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:45:12 BoogieIcfgContainer [2019-08-05 10:45:12,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:45:12,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:45:12,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:45:12,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:45:12,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:12" (1/2) ... [2019-08-05 10:45:12,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52648444 and model type jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:45:12, skipping insertion in model container [2019-08-05 10:45:12,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:45:12" (2/2) ... [2019-08-05 10:45:12,399 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:45:12,408 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:45:12,416 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:45:12,431 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:45:12,458 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:45:12,458 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:45:12,459 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:45:12,459 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:45:12,459 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:45:12,459 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:45:12,459 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:45:12,459 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:45:12,460 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:45:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:45:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:45:12,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:45:12,486 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:45:12,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,648 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:45:12,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:45:12,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:45:12,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:45:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:45:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:45:12,675 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:45:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,765 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:45:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:45:12,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:45:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,781 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:45:12,781 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:45:12,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:45:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:45:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:45:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:45:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:45:12,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:45:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,831 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:45:12,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:45:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:45:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:45:12,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:45:12,832 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:45:12,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:45:13,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:45:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:45:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:45:13,044 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:45:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,082 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:45:13,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:45:13,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:45:13,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,083 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:45:13,083 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:45:13,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:45:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:45:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:45:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:45:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:45:13,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:45:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,086 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:45:13,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:45:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:45:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:45:13,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,087 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:45:13,088 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:45:13,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:45:13,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:45:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:45:13,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:45:13,273 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:45:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,323 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:45:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:45:13,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:45:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,325 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:45:13,325 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:45:13,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:45:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:45:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:45:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:45:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:45:13,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:45:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,328 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:45:13,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:45:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:45:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:45:13,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,329 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:45:13,329 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:45:13,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:45:13,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:45:13,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:45:13,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:45:13,616 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:45:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,765 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:45:13,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:45:13,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:45:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,766 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:45:13,766 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:45:13,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:45:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:45:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:45:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:45:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:45:13,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:45:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,771 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:45:13,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:45:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:45:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:45:13,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,772 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:45:13,772 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:45:13,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:45:13,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:45:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:45:13,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:45:13,938 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:45:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,039 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:45:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:45:14,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:45:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,042 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:45:14,043 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:45:14,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:45:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:45:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:45:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:45:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:45:14,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:45:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,047 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:45:14,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:45:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:45:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:45:14,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,048 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:45:14,048 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:45:14,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:45:14,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:45:14,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:45:14,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:45:14,287 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:45:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,374 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:45:14,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:45:14,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:45:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,376 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:45:14,377 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:45:14,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:45:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:45:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:45:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:45:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:45:14,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:45:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,380 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:45:14,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:45:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:45:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:45:14,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,381 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:45:14,381 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:45:14,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,402 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:45:14,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:45:14,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:45:14,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:45:14,877 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:45:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,975 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:45:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:45:14,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:45:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,977 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:45:14,977 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:45:14,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:45:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:45:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:45:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:45:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:45:14,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:45:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,981 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:45:14,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:45:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:45:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:45:14,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,981 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:45:14,982 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:45:14,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,002 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:15,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:15,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:45:15,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:45:15,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:45:15,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:45:15,180 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:45:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,274 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:45:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:45:15,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:45:15,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,276 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:45:15,276 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:45:15,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:45:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:45:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:45:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:45:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:45:15,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:45:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,281 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:45:15,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:45:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:45:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:45:15,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,282 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:45:15,282 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:45:15,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,304 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:15,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:15,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:45:15,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:45:15,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:45:15,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:15,506 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:45:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,703 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:45:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:45:15,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:45:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,704 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:45:15,704 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:45:15,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:45:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:45:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:45:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:45:15,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:45:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,708 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:45:15,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:45:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:45:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:45:15,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,709 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:45:15,709 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,709 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:45:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:15,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:15,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:45:15,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:45:15,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:45:15,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:45:15,985 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:45:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:16,096 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:45:16,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:45:16,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:45:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:16,097 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:45:16,098 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:45:16,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:45:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:45:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:45:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:45:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:45:16,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:45:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:16,102 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:45:16,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:45:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:45:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:45:16,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:16,103 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:45:16,103 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:16,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:45:16,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:16,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:45:16,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:16,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:16,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:45:16,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:45:16,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:45:16,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:45:16,367 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:45:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:16,517 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:45:16,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:45:16,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:45:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:16,525 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:45:16,525 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:45:16,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:45:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:45:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:45:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:45:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:45:16,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:45:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:16,528 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:45:16,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:45:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:45:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:45:16,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:16,529 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:45:16,529 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:45:16,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:16,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:45:16,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:16,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:45:16,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:45:16,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:45:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:45:16,818 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:45:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:16,988 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:45:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:45:16,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:45:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:16,990 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:45:16,990 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:45:16,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:45:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:45:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:45:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:45:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:45:16,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:45:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:16,995 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:45:16,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:45:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:45:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:45:16,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:16,996 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:45:16,996 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:45:16,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:17,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:45:17,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:17,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:17,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:45:17,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:45:17,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:45:17,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:45:17,443 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:45:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:17,723 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:45:17,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:45:17,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:45:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:17,730 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:45:17,730 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:45:17,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:45:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:45:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:45:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:45:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:45:17,734 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:45:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:17,734 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:45:17,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:45:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:45:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:45:17,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:17,735 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:45:17,735 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:45:17,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:17,762 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:45:17,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:45:18,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:45:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:45:18,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:45:18,050 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:45:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:18,241 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:45:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:45:18,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:45:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:18,243 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:45:18,243 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:45:18,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:45:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:45:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:45:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:45:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:45:18,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:45:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:18,247 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:45:18,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:45:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:45:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:45:18,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:18,248 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:45:18,248 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:45:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:18,266 WARN L254 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:45:18,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:45:18,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:45:18,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:45:18,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:18,824 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:45:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,176 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:45:19,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:45:19,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:45:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:19,177 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:45:19,177 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:45:19,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:45:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:45:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:45:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:45:19,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:45:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:19,181 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:45:19,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:45:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:45:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:45:19,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:19,182 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:45:19,182 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:19,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:45:19,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:19,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:19,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:19,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:19,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:19,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:45:19,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:45:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:19,834 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:45:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:20,073 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:45:20,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:45:20,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:45:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:20,074 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:45:20,074 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:45:20,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:45:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:45:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:45:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:45:20,079 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:45:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:20,079 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:45:20,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:45:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:45:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:20,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:20,080 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:45:20,080 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:45:20,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:20,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:20,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:20,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:20,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:20,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:20,449 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:45:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:20,781 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:45:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:20,782 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:20,782 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:45:20,782 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:45:20,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:45:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:45:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:45:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:45:20,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:45:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:20,786 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:45:20,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:45:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:20,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:20,787 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:45:20,787 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:45:20,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:20,803 WARN L254 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:20,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:21,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:21,172 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:45:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,535 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:45:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:21,536 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,537 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:45:21,537 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:45:21,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:45:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:45:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:45:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:45:21,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:45:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,541 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:45:21,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:45:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:21,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,542 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:45:21,542 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:45:21,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,557 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:21,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:21,933 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:45:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:22,302 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:45:22,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:22,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:22,305 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:45:22,305 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:45:22,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:45:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:45:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:45:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:45:22,309 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:45:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:22,310 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:45:22,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:45:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:22,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:22,311 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:45:22,311 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:45:22,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:22,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:45:22,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:23,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:23,021 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:45:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:23,417 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:45:23,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:23,418 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:23,418 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:45:23,419 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:45:23,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:45:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:45:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:45:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:45:23,423 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:45:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:23,423 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:45:23,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:45:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:23,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:23,424 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:45:23,424 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:45:23,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:23,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:45:23,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:23,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:23,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:23,894 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:45:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:24,406 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:45:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:24,406 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:45:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:24,407 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:45:24,407 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:45:24,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:45:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:45:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:45:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:45:24,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:45:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:24,411 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:45:24,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:45:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:45:24,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:24,412 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:45:24,413 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:45:24,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:24,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:45:24,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:24,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:24,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:45:24,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:24,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:24,843 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:45:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:25,279 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:45:25,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:25,282 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:45:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:25,283 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:45:25,283 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:45:25,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:45:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:45:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:45:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:45:25,286 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:45:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:25,287 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:45:25,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:45:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:45:25,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:25,288 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:45:25,288 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:25,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:45:25,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:25,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:45:25,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:26,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:26,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:45:26,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:45:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:45:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:26,180 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:45:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:26,995 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:45:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:45:26,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:45:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:26,998 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:45:26,998 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:45:26,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:45:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:45:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:45:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:45:27,001 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:45:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:27,001 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:45:27,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:45:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:45:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:45:27,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:27,002 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:45:27,002 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:45:27,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:27,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:45:27,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:27,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:27,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:45:27,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:45:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:45:27,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:27,553 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:45:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:28,239 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:45:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:45:28,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:45:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:28,240 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:45:28,240 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:45:28,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:45:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:45:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:45:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:45:28,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:45:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:28,245 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:45:28,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:45:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:45:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:45:28,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:28,246 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:45:28,246 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:45:28,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:28,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:45:28,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:29,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:29,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:45:29,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:45:29,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:45:29,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:29,011 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:45:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:29,538 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:45:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:45:29,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:45:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:29,540 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:45:29,540 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:45:29,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:45:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:45:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:45:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:45:29,544 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:45:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:29,544 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:45:29,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:45:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:45:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:45:29,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:29,545 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:45:29,546 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:45:29,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:29,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:45:29,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:45:30,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:45:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:45:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:45:30,096 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:45:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:30,687 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:45:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:45:30,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:45:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:30,688 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:45:30,688 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:45:30,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:45:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:45:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:45:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:45:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:45:30,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:45:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:30,693 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:45:30,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:45:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:45:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:45:30,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:30,693 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:45:30,694 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:45:30,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:30,712 WARN L254 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:45:30,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:32,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:32,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:45:32,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:45:32,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:45:32,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:32,145 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:45:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:32,783 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:45:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:45:32,783 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:45:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:32,784 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:45:32,784 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:45:32,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:45:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:45:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:45:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:45:32,787 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:45:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:32,788 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:45:32,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:45:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:45:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:45:32,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:32,788 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:45:32,789 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:45:32,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:32,808 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:45:32,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:33,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:33,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:45:33,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:45:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:45:33,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:45:33,816 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:45:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:34,474 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:45:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:45:34,474 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:45:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:34,475 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:45:34,475 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:45:34,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:45:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:45:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:45:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:45:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:45:34,480 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:45:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:34,480 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:45:34,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:45:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:45:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:45:34,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,481 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:45:34,481 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:45:34,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,501 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:35,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:45:35,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:45:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:45:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:45:35,128 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:45:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,849 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:45:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:45:35,850 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:45:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,850 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:45:35,851 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:45:35,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:45:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:45:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:45:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:45:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:45:35,855 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:45:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,855 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:45:35,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:45:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:45:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:45:35,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,856 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:45:35,856 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:45:35,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,876 WARN L254 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:45:36,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:45:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:45:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:45:36,665 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:45:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,423 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:45:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:45:37,428 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:45:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,429 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:45:37,429 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:45:37,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:45:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:45:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:45:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:45:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:45:37,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:45:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,436 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:45:37,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:45:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:45:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:45:37,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,437 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:45:37,437 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:45:37,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:38,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:38,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:45:38,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:45:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:45:38,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:45:38,117 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:45:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,909 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:45:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:45:38,909 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:45:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,910 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:45:38,910 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:45:38,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:45:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:45:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:45:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:45:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:45:38,913 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:45:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,914 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:45:38,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:45:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:45:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:45:38,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,914 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:45:38,914 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:45:38,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:39,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:45:39,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:45:39,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:45:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:45:39,733 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:45:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:40,582 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:45:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:45:40,583 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:45:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:40,583 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:45:40,584 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:45:40,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:45:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:45:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:45:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:45:40,588 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:45:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:40,588 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:45:40,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:45:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:45:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:45:40,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:40,589 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:45:40,589 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:45:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:40,616 WARN L254 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:45:40,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:41,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:41,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:45:41,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:45:41,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:45:41,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:41,701 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:45:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:42,636 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:45:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:45:42,637 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:45:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:42,637 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:45:42,637 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:45:42,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:45:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:45:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:45:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:45:42,641 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:45:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:42,641 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:45:42,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:45:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:45:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:45:42,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:42,642 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:45:42,642 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:45:42,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:42,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:45:42,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:43,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:43,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:45:43,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:45:43,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:45:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:43,569 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:45:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:44,514 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:45:44,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:45:44,515 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:45:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:44,515 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:45:44,515 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:45:44,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:45:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:45:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:45:44,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:45:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:44,519 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:45:44,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:45:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:45:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:45:44,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:44,519 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:45:44,520 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:44,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:45:44,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:44,556 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:45:44,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:45,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:45,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:45:45,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:45:45,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:45:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:45,604 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:45:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:46,724 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:45:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:45:46,725 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:45:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:46,726 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:45:46,726 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:45:46,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:45:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:45:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:45:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:45:46,729 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:45:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:46,729 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:45:46,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:45:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:45:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:45:46,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:46,730 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:45:46,730 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:45:46,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:46,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:45:46,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:48,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:48,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:45:48,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:45:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:45:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:48,133 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:45:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,184 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:45:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:45:49,185 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:45:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,186 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:45:49,186 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:45:49,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:45:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:45:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:45:49,189 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:45:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,189 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:45:49,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:45:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:45:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:45:49,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,190 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:45:49,190 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:45:49,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,214 WARN L254 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:50,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:50,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:45:50,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:45:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:45:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:50,103 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:45:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:51,192 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:45:51,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:45:51,193 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:45:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:51,194 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:45:51,194 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:45:51,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:45:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:45:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:45:51,197 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:45:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:51,198 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:45:51,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:45:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:45:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:45:51,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:51,198 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:45:51,199 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:45:51,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:51,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:45:51,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:52,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:52,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:45:52,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:45:52,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:45:52,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:52,397 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:45:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:53,569 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:45:53,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:45:53,570 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:45:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:53,570 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:45:53,570 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:45:53,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:45:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:45:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:45:53,574 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:45:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:53,574 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:45:53,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:45:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:45:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:45:53,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:53,575 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:45:53,575 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:53,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:45:53,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:53,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:45:53,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:54,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:54,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:45:54,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:45:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:45:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:54,557 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:45:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:55,804 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:45:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:45:55,804 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:45:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:55,805 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:45:55,805 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:45:55,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:45:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:45:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:45:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:45:55,809 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:45:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:55,809 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:45:55,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:45:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:45:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:45:55,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:55,810 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:45:55,810 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:55,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:55,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:45:55,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:55,831 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:45:55,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:57,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:45:57,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:45:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:45:57,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:57,063 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:45:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:58,386 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:45:58,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:45:58,387 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:45:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:58,388 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:45:58,388 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:45:58,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:45:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:45:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:45:58,392 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:45:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:58,392 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:45:58,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:45:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:45:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:45:58,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:58,393 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:45:58,393 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:45:58,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:58,418 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:45:58,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:59,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:59,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:45:59,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:45:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:45:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:59,471 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:46:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:00,860 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:46:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:46:00,861 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:46:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:00,862 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:46:00,862 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:46:00,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:46:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:46:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:46:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:46:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:46:00,866 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:46:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:00,866 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:46:00,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:46:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:46:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:46:00,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:00,866 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:46:00,867 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:00,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:00,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:46:00,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:00,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:46:00,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:02,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:02,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:46:02,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:46:02,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:46:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:46:02,306 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:46:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:03,748 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:46:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:46:03,749 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:46:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:03,750 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:46:03,750 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:46:03,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:46:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:46:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:46:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:46:03,752 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:46:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:03,753 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:46:03,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:46:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:46:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:46:03,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:03,753 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:46:03,753 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:03,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:46:03,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:03,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:46:03,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:04,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:04,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:46:04,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:46:04,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:46:04,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:46:04,934 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:46:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:06,432 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:46:06,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:46:06,433 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:46:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:06,433 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:46:06,434 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:46:06,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:46:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:46:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:46:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:46:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:46:06,437 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:46:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:06,437 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:46:06,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:46:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:46:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:46:06,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:06,438 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:46:06,438 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:06,439 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:46:06,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:06,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 10:46:06,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:46:07,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:46:07,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:46:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:46:07,829 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:46:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:09,379 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:46:09,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:46:09,380 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:46:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:09,381 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:46:09,381 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:46:09,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:46:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:46:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:46:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:46:09,384 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:46:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:09,384 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:46:09,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:46:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:46:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:46:09,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:09,385 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:46:09,385 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:09,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:09,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:46:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:09,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 10:46:09,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:10,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:10,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:46:10,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:46:10,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:46:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:10,623 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:46:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:12,370 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:46:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:46:12,371 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:46:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:12,372 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:46:12,372 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:46:12,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:46:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:46:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:46:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:46:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:46:12,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:46:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:12,375 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:46:12,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:46:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:46:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:46:12,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:12,376 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:46:12,376 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:12,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:46:12,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:12,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:46:12,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:13,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:46:13,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:46:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:46:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:13,769 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:46:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:15,491 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:46:15,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:46:15,492 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:46:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:15,493 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:46:15,493 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:46:15,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:46:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:46:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:46:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:46:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:46:15,495 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:46:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:15,496 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:46:15,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:46:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:46:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:46:15,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:15,497 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:46:15,497 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:15,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:46:15,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:15,528 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 10:46:15,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:17,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:17,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:46:17,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:46:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:46:17,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:17,044 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:46:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:18,922 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:46:18,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:46:18,923 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:46:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:18,923 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:46:18,924 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:46:18,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:46:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:46:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:46:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:46:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:46:18,926 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:46:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:18,926 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:46:18,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:46:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:46:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:46:18,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:18,927 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:46:18,927 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:46:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:18,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 10:46:18,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:21,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:21,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:46:21,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:46:21,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:46:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:21,033 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:46:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:22,991 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:46:22,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:46:22,991 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:46:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:22,992 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:46:22,992 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:46:22,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:46:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:46:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:46:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:46:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:46:22,996 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:46:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:22,998 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:46:22,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:46:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:46:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:46:22,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:22,998 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:46:22,999 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:22,999 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:46:23,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:23,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:46:23,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:24,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:46:24,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:46:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:46:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:24,443 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:46:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:26,372 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:46:26,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:46:26,372 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:46:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:26,373 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:46:26,373 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:46:26,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:46:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:46:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:46:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:46:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:46:26,376 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:46:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:26,377 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:46:26,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:46:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:46:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:46:26,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:26,378 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:46:26,378 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:46:26,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:26,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 10:46:26,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:28,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:46:28,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:46:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:46:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:28,207 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:46:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:30,193 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:46:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:46:30,193 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:46:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:30,194 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:46:30,194 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:46:30,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:46:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:46:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:46:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:46:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:46:30,198 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:46:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:30,198 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:46:30,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:46:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:46:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:46:30,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:30,199 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:46:30,199 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:30,199 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:46:30,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:30,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:46:30,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:31,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:31,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:46:31,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:46:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:46:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:46:31,795 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:46:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:33,957 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:46:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:46:33,958 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:46:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:33,959 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:46:33,959 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:46:33,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:46:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:46:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:46:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:46:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:46:33,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:46:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:33,962 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:46:33,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:46:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:46:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:46:33,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:33,963 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:46:33,963 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:33,964 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:46:33,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:34,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:46:34,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:35,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:35,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:46:35,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:46:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:46:35,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:46:35,800 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:46:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:38,067 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:46:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:46:38,067 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:46:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:38,068 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:46:38,068 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:46:38,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:46:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:46:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:46:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:46:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:46:38,071 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:46:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:38,071 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:46:38,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:46:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:46:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:46:38,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:38,072 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:46:38,073 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:46:38,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:38,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 10:46:38,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:39,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:39,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:46:39,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:46:39,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:46:39,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:46:39,890 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:46:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:42,124 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:46:42,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:46:42,125 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:46:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:42,126 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:46:42,126 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:46:42,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:46:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:46:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:46:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:46:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:46:42,129 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:46:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:42,130 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:46:42,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:46:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:46:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:46:42,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:42,130 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:46:42,131 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:46:42,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:42,169 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 10:46:42,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:44,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:44,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:46:44,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:46:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:46:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:46:44,097 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:46:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:46,400 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:46:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:46:46,400 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:46:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:46,401 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:46:46,401 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:46:46,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:46:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:46:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:46:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:46:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:46:46,404 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:46:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:46,405 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:46:46,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:46:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:46:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:46:46,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:46,405 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:46:46,406 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:46:46,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:46,450 WARN L254 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:46:46,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:48,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:48,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:46:48,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:46:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:46:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:46:48,397 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:46:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:50,828 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:46:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:46:50,828 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:46:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:50,829 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:46:50,829 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:46:50,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:46:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:46:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:46:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:46:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:46:50,831 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:46:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:50,832 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:46:50,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:46:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:46:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:46:50,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:50,833 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:46:50,833 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:46:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:50,879 WARN L254 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 10:46:50,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:52,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:52,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:46:52,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:46:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:46:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:46:52,815 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:46:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:55,383 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:46:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:46:55,383 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:46:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:55,384 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:46:55,385 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:46:55,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:46:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:46:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:46:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:46:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:46:55,388 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:46:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:55,388 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:46:55,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:46:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:46:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:46:55,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:55,389 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:46:55,389 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:55,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:46:55,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:55,428 WARN L254 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 10:46:55,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:57,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:57,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:46:57,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:46:57,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:46:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:46:57,243 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:46:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:59,972 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:46:59,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:46:59,973 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:46:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:59,974 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:46:59,974 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:46:59,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:46:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:46:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:46:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:46:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:46:59,977 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:46:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:59,977 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:46:59,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:46:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:46:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:46:59,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:59,978 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:46:59,979 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:59,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:59,979 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:46:59,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:00,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:47:00,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:02,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:02,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:47:02,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:47:02,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:47:02,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:47:02,469 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:47:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:05,303 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:47:05,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:47:05,303 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:47:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:05,304 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:47:05,304 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:47:05,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:47:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:47:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:47:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:47:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:47:05,307 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:47:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:05,308 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:47:05,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:47:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:47:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:47:05,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:05,309 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:47:05,309 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:05,309 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:47:05,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:05,347 WARN L254 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 10:47:05,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:07,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:07,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:47:07,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:47:07,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:47:07,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:47:07,448 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:47:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,384 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:47:10,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:47:10,384 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:47:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,385 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:47:10,385 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:47:10,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:47:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:47:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:47:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:47:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:47:10,388 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:47:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,388 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:47:10,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:47:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:47:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:47:10,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,389 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:47:10,389 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:47:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,431 WARN L254 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:12,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:12,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:47:12,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:47:12,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:47:12,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:47:12,474 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:47:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:15,484 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:47:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:47:15,485 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:47:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:15,485 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:47:15,486 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:47:15,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:47:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:47:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:47:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:47:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:47:15,489 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:47:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:15,489 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:47:15,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:47:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:47:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:47:15,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:15,489 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:47:15,490 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:47:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:15,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:47:15,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:17,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:17,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:47:17,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:47:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:47:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:47:17,760 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:47:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:20,835 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:47:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:47:20,836 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:47:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:20,837 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:47:20,837 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:47:20,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:47:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:47:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:47:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:47:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:47:20,840 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:47:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:20,840 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:47:20,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:47:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:47:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:47:20,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:20,841 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:47:20,841 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:47:20,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:20,882 WARN L254 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 10:47:20,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:23,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:23,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:47:23,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:47:23,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:47:23,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:47:23,173 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:47:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:26,366 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:47:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:47:26,366 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:47:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:26,367 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:47:26,367 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:47:26,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:47:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:47:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:47:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:47:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:47:26,370 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:47:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:26,370 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:47:26,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:47:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:47:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:47:26,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:26,372 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:47:26,372 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:26,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:26,372 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:47:26,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:26,437 WARN L254 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 10:47:26,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:28,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:28,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:47:28,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:47:28,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:47:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:47:28,746 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:47:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,993 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:47:31,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:47:31,994 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:47:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,995 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:47:31,995 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:47:31,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:47:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:47:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:47:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:47:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:47:31,998 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:47:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,998 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:47:31,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:47:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:47:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:47:31,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,999 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:47:32,000 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:32,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:47:32,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,042 WARN L254 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:35,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:35,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:47:35,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:47:35,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:47:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:47:35,243 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:47:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,483 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:47:38,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:47:38,483 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:47:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,484 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:47:38,484 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:47:38,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:47:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:47:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:47:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:47:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:47:38,488 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:47:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,488 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:47:38,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:47:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:47:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:47:38,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,489 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:47:38,490 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,490 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:47:38,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:47:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:47:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:47:40,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:47:40,970 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:47:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,420 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:47:44,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:47:44,421 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:47:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,422 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:47:44,422 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:44,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:47:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:47:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:47:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:47:44,425 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:47:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,425 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:47:44,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:47:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:47:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:47:44,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,426 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:47:44,427 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:47:44,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,469 WARN L254 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:47,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:47:47,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:47:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:47:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:47:47,699 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:47:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:51,288 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:47:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:47:51,289 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:47:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:51,290 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:51,290 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:47:51,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:47:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:47:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:47:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:47:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:47:51,292 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:47:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:51,293 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:47:51,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:47:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:47:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:47:51,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:51,294 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:47:51,294 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:51,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:51,294 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:47:51,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:51,338 WARN L254 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:47:51,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:54,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:47:54,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:47:54,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:47:54,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:47:54,075 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:47:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,797 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:47:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:47:57,797 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:47:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,798 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:47:57,798 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:47:57,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:47:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:47:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:47:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:47:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:47:57,801 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:47:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,801 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:47:57,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:47:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:47:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:47:57,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,803 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:47:57,803 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:47:57,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:00,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:00,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:48:00,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:48:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:48:00,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:48:00,736 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:48:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:04,438 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:48:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:48:04,439 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:48:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:04,440 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:48:04,440 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:48:04,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:48:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:48:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:48:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:48:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:48:04,442 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:48:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:04,443 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:48:04,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:48:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:48:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:48:04,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:04,448 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:48:04,449 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:04,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:48:04,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:04,506 WARN L254 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:48:04,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:07,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:07,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:48:07,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:48:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:48:07,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:48:07,358 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:48:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:11,302 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:48:11,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:48:11,302 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:48:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:11,303 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:48:11,303 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:48:11,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:48:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:48:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:48:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:48:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:48:11,306 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:48:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:11,307 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:48:11,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:48:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:48:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:48:11,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:11,308 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:48:11,308 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:48:11,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:11,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:48:11,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:14,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:14,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:48:14,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:48:14,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:48:14,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:48:14,230 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:48:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:18,244 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:48:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:48:18,244 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:48:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:18,245 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:48:18,245 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:48:18,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:48:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:48:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:48:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:48:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:48:18,249 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:48:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:18,249 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:48:18,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:48:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:48:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:48:18,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:18,250 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:48:18,250 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:48:18,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:18,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-05 10:48:18,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:21,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:48:21,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:48:21,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:48:21,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:48:21,523 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:48:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,639 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:48:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:48:25,640 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:48:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,641 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:48:25,641 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:25,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:48:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:48:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:48:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:48:25,644 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:48:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,644 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:48:25,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:48:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:48:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:48:25,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,645 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:48:25,645 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:48:25,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:28,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:48:28,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:48:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:48:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:28,898 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:48:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:33,132 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:48:33,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:48:33,132 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:48:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:33,133 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:33,134 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:48:33,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:48:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:48:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:48:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:48:33,137 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:48:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:33,137 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:48:33,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:48:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:48:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:48:33,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:33,138 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:48:33,138 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:48:33,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:33,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:48:33,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:36,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:36,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:48:36,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:48:36,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:48:36,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:48:36,405 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:48:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:40,796 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:48:40,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:48:40,796 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:48:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:40,797 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:48:40,798 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:48:40,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:48:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:48:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:48:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:48:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:48:40,801 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:48:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:40,801 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:48:40,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:48:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:48:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:48:40,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:40,801 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:48:40,802 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:40,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:48:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:40,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-05 10:48:40,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:43,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:43,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:48:43,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:48:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:48:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:48:43,932 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:48:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:48,405 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:48:48,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:48:48,406 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:48:48,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:48,406 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:48:48,407 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:48:48,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:48:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:48:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:48:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:48:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:48:48,410 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:48:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:48,410 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:48:48,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:48:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:48:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:48:48,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:48,411 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:48:48,411 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:48:48,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:48,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 10:48:48,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:51,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:51,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:48:51,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:48:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:48:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:48:51,764 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:48:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:56,434 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:48:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:48:56,434 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:48:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:56,435 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:48:56,435 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:48:56,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:48:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:48:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:48:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:48:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:48:56,438 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:48:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:56,439 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:48:56,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:48:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:48:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:48:56,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:56,440 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:48:56,440 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:48:56,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:56,496 WARN L254 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 10:48:56,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:59,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:59,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:48:59,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:48:59,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:48:59,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:48:59,813 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:49:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:04,725 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:49:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:49:04,726 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:49:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:04,727 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:49:04,727 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:49:04,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:49:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:49:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:49:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:49:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:49:04,730 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:49:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:04,730 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:49:04,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:49:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:49:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:49:04,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:04,732 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:49:04,732 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:04,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:49:04,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:04,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 313 conjunts are in the unsatisfiable core [2019-08-05 10:49:04,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:49:08,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:49:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:49:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:49:08,741 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:49:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:13,587 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:49:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:49:13,587 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:49:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:13,588 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:49:13,588 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:49:13,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:49:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:49:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:49:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:49:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:49:13,591 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:49:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:13,592 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:49:13,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:49:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:49:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:49:13,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:13,592 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:49:13,593 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:49:13,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,666 WARN L254 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:17,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:49:17,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:49:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:49:17,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:49:17,201 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:49:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:22,589 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:49:22,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:49:22,590 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:49:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:22,591 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:49:22,591 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:49:22,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:49:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:49:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:49:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:49:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:49:22,594 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:49:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:22,594 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:49:22,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:49:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:49:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:49:22,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:22,595 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:49:22,596 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:49:22,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:22,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 321 conjunts are in the unsatisfiable core [2019-08-05 10:49:22,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:49:24,740 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:49:24,740 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:49:24,744 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:49:24,744 INFO L202 PluginConnector]: Adding new model jm2006.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:49:24 BoogieIcfgContainer [2019-08-05 10:49:24,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:49:24,747 INFO L168 Benchmark]: Toolchain (without parser) took 252664.19 ms. Allocated memory was 140.0 MB in the beginning and 210.2 MB in the end (delta: 70.3 MB). Free memory was 108.3 MB in the beginning and 76.9 MB in the end (delta: 31.4 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:24,747 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.31 ms. Allocated memory is still 140.0 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:49:24,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 140.0 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:24,748 INFO L168 Benchmark]: Boogie Preprocessor took 23.42 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:24,749 INFO L168 Benchmark]: RCFGBuilder took 243.13 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 95.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:24,749 INFO L168 Benchmark]: TraceAbstraction took 252352.12 ms. Allocated memory was 140.0 MB in the beginning and 210.2 MB in the end (delta: 70.3 MB). Free memory was 95.1 MB in the beginning and 76.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:24,752 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.31 ms. Allocated memory is still 140.0 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 140.0 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.42 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 243.13 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 95.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252352.12 ms. Allocated memory was 140.0 MB in the beginning and 210.2 MB in the end (delta: 70.3 MB). Free memory was 95.1 MB in the beginning and 76.9 MB in the end (delta: 18.2 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 78,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 252.2s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 135.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 167401 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 109.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 111.4s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1798073 SizeOfPredicates, 312 NumberOfNonLiveVariables, 17199 ConjunctsInSsa, 12714 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/79079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown