java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:45:33,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:45:33,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:45:33,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:45:33,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:45:33,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:45:33,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:45:33,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:45:33,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:45:33,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:45:33,931 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:45:33,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:45:33,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:45:33,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:45:33,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:45:33,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:45:33,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:45:33,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:45:33,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:45:33,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:45:33,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:45:33,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:45:33,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:45:33,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:45:33,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:45:33,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:45:33,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:45:33,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:45:33,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:45:33,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:45:33,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:45:33,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:45:33,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:45:33,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:45:33,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:45:33,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:45:33,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:45:33,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:45:33,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:45:33,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:45:33,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:45:34,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:45:34,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:45:34,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:45:34,030 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:45:34,030 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:45:34,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:45:34,032 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:45:34,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:45:34,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:45:34,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:45:34,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:45:34,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:45:34,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:45:34,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:45:34,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:45:34,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:45:34,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/1) ... [2019-08-05 10:45:34,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:45:34,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:45:34,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:45:34,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:45:34,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (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:34,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:45:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:45:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:45:34,436 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:45:34,436 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:45:34,438 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:45:34 BoogieIcfgContainer [2019-08-05 10:45:34,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:45:34,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:45:34,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:45:34,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:45:34,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:45:34" (1/2) ... [2019-08-05 10:45:34,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee2eb1 and model type count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:45:34, skipping insertion in model container [2019-08-05 10:45:34,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:45:34" (2/2) ... [2019-08-05 10:45:34,450 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:45:34,459 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:45:34,468 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:45:34,485 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:45:34,509 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:45:34,510 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:45:34,510 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:45:34,511 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:45:34,511 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:45:34,511 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:45:34,511 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:45:34,511 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:45:34,511 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:45:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:45:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:45:34,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:45:34,537 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-08-05 10:45:34,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:34,715 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:34,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:45:34,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:45:34,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:45:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:45:34,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:45:34,736 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:45:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:34,769 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:45:34,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:45:34,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:45:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:34,782 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:45:34,783 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:45:34,785 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:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:45:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:45:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:45:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:45:34,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:45:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:34,818 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:45:34,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:45:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:45:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:45:34,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:45:34,819 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,819 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-08-05 10:45:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,021 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:35,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:45:35,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:45:35,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:45:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:45:35,024 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:45:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,075 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:45:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:45:35,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:45:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,076 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:45:35,077 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:45:35,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:45:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:45:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:45:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:45:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:45:35,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:45:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,079 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:45:35,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:45:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:45:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:45:35,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,081 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:45:35,081 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2019-08-05 10:45:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,190 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:35,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:45:35,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:45:35,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:45:35,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:45:35,192 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:45:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,285 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:45:35,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:45:35,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:45:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,287 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:45:35,288 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:45:35,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:45:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:45:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:45:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:45:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:45:35,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:45:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,292 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:45:35,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:45:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:45:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:45:35,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,294 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:45:35,294 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,295 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2019-08-05 10:45:35,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,480 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:35,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:45:35,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:45:35,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:45:35,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:45:35,482 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:45:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,831 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:45:35,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:45:35,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:45:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,832 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:45:35,833 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:45:35,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:45:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:45:35,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:45:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:45:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:45:35,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:45:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,836 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:45:35,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:45:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:45:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:45:35,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,837 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:45:35,837 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2019-08-05 10:45:35,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,994 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:35,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:45:35,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:45:35,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:45:35,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:45:35,996 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:45:36,176 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-08-05 10:45:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:36,248 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:45:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:45:36,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:45:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:36,249 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:45:36,250 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:45:36,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:45:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:45:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:45:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:45:36,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:45:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:36,253 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:45:36,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:45:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:45:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:45:36,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:36,255 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:45:36,255 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2019-08-05 10:45:36,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:36,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:45:36,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:36,444 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:36,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:36,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:45:36,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:45:36,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:45:36,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:45:36,446 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:45:36,624 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2019-08-05 10:45:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:36,907 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:45:36,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:45:36,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:45:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:36,909 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:45:36,909 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:45:36,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:45:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:45:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:45:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:45:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:45:36,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:45:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:36,913 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:45:36,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:45:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:45:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:45:36,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:36,913 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:45:36,914 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2019-08-05 10:45:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:36,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:45:36,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:37,087 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:37,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:37,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:45:37,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:45:37,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:45:37,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:45:37,088 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:45:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,273 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:45:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:45:37,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:45:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,274 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:45:37,274 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:45:37,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:45:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:45:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:45:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:45:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:45:37,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:45:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,278 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:45:37,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:45:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:45:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:45:37,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,279 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:45:37,279 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2019-08-05 10:45:37,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:37,456 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:37,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:37,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:45:37,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:45:37,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:45:37,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:45:37,458 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:45:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,783 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:45:37,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:45:37,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:45:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,785 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:45:37,785 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:45:37,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:45:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:45:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:45:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:45:37,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:45:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,789 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:45:37,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:45:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:45:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:45:37,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,790 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:45:37,791 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,791 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2019-08-05 10:45:37,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:37,960 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:37,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:37,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:45:37,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:45:37,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:45:37,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:37,961 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:45:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,185 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:45:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:45:38,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:45:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,187 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:45:38,187 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:45:38,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:45:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:45:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:45:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:45:38,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:45:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,191 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:45:38,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:45:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:45:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:45:38,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,192 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:45:38,192 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2019-08-05 10:45:38,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:38,394 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:38,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:38,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:45:38,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:45:38,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:45:38,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:45:38,396 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:45:38,716 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2019-08-05 10:45:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,833 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:45:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:45:38,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:45:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,835 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:45:38,835 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:45:38,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:45:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:45:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:45:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:45:38,839 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:45:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,840 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:45:38,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:45:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:45:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:45:38,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,840 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:45:38,841 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2019-08-05 10:45:38,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:39,027 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:39,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:39,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:45:39,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:45:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:45:39,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:45:39,029 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:45:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:39,370 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:45:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:45:39,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:45:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:39,372 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:45:39,372 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:45:39,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:45:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:45:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:45:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:45:39,376 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:45:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:39,376 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:45:39,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:45:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:45:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:45:39,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:39,377 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:45:39,377 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2019-08-05 10:45:39,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:39,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:45:39,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:39,714 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:39,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:39,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:45:39,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:45:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:45:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:45:39,715 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:45:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:40,115 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:45:40,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:45:40,116 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:45:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:40,117 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:45:40,117 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:45:40,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:45:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:45:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:45:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:45:40,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:45:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:40,121 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:45:40,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:45:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:45:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:45:40,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:40,123 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:45:40,123 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:40,123 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2019-08-05 10:45:40,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:40,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:45:40,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:40,419 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:40,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:45:40,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:45:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:45:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:45:40,421 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:45:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:40,863 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:45:40,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:45:40,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:45:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:40,865 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:45:40,865 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:45:40,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:45:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:45:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:45:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:45:40,869 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:45:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:40,870 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:45:40,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:45:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:45:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:45:40,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:40,871 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:45:40,871 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:40,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2019-08-05 10:45:40,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:40,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:45:40,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:41,210 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:41,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:41,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:45:41,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:45:41,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:45:41,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:45:41,212 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:45:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:41,753 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:45:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:45:41,753 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:45:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:41,754 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:45:41,754 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:45:41,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:45:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:45:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:45:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:45:41,757 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:45:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:41,758 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:45:41,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:45:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:45:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:45:41,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:41,758 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:45:41,759 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2019-08-05 10:45:41,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:41,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:45:41,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:42,298 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:42,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:45:42,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:45:42,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:45:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:42,299 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:45:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:42,962 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:45:42,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:45:42,963 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:45:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:42,963 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:45:42,964 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:45:42,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:45:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:45:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:45:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:45:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:45:42,969 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:45:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:42,971 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:45:42,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:45:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:45:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:45:42,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:42,972 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:45:42,972 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2019-08-05 10:45:42,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:43,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:45:43,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:43,239 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:43,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:43,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:43,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:45:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:45:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:43,240 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:45:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:43,973 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:45:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:45:43,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:45:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:43,975 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:45:43,975 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:45:43,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:45:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:45:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:45:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:45:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:45:43,979 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:45:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:43,980 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:45:43,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:45:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:45:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:43,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:43,981 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:45:43,981 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2019-08-05 10:45:43,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:43,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:45:44,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:44,204 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:44,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:44,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:44,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:44,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:44,206 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:45:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:44,888 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:45:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:44,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:44,890 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:45:44,891 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:45:44,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:45:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:45:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:45:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:45:44,893 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:45:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:44,894 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:45:44,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:45:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:44,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:44,894 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:45:44,895 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2019-08-05 10:45:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:44,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:45:44,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:45,212 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:45,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:45,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:45,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:45,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:45,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:45,214 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:45:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:45,875 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:45:45,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:45,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:45,876 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:45:45,876 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:45:45,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:45:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:45:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:45:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:45:45,881 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:45:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:45,881 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:45:45,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:45:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:45,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:45,882 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:45:45,882 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:45,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2019-08-05 10:45:45,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:45,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:45:45,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:46,179 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:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:46,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:46,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:46,181 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:45:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:47,090 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:45:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:47,090 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:47,091 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:45:47,091 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:45:47,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:45:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:45:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:45:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:45:47,096 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:45:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:47,096 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:45:47,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:45:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:47,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:47,097 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:45:47,097 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2019-08-05 10:45:47,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:47,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:45:47,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:47,432 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:47,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:47,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:47,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:47,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:47,434 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:45:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:48,274 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:45:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:48,274 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:48,275 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:45:48,276 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:45:48,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:45:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:45:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:45:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:45:48,280 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:45:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:48,280 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:45:48,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:45:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:48,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:48,281 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:45:48,282 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:48,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2019-08-05 10:45:48,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:48,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:45:48,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:48,614 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:48,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:48,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:48,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:48,617 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:45:48,814 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2019-08-05 10:45:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,616 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:45:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:49,616 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:45:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,617 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:45:49,617 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:45:49,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:45:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:45:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:45:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:45:49,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:45:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,622 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:45:49,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:45:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:45:49,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,623 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:45:49,623 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2019-08-05 10:45:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:49,996 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:49,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:49,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:45:49,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:49,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:49,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:49,998 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:45:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:50,977 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:45:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:50,980 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:45:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:50,980 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:45:50,981 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:45:50,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:45:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:45:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:45:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:45:50,985 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:45:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:50,985 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:45:50,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:45:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:45:50,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:50,986 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:45:50,986 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2019-08-05 10:45:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:51,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:45:51,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:51,629 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:51,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:51,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:45:51,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:45:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:45:51,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:51,630 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:45:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:52,805 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:45:52,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:45:52,806 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:45:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:52,806 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:45:52,807 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:45:52,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:45:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:45:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:45:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:45:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:45:52,812 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:45:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:52,812 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:45:52,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:45:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:45:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:45:52,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:52,813 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:45:52,813 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2019-08-05 10:45:52,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:52,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:45:52,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:53,214 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:53,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:53,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:45:53,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:45:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:45:53,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:53,216 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:45:54,410 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2019-08-05 10:45:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:54,608 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:45:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:45:54,609 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:45:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:54,609 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:45:54,610 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:45:54,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:45:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:45:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:45:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:45:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:45:54,615 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:45:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:54,615 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:45:54,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:45:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:45:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:45:54,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:54,616 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:45:54,616 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2019-08-05 10:45:54,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:54,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:45:54,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:55,024 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:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:55,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:45:55,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:45:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:45:55,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:55,026 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:45:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:56,336 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:45:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:45:56,336 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:45:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:56,337 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:45:56,337 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:45:56,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:45:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:45:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:45:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:45:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:45:56,342 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:45:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:56,342 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:45:56,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:45:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:45:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:45:56,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:56,343 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:45:56,343 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2019-08-05 10:45:56,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:56,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:45:56,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:57,073 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:57,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:57,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:45:57,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:45:57,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:45:57,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:45:57,075 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:45:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:58,431 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:45:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:45:58,431 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:45:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:58,432 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:45:58,432 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:45:58,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:45:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:45:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:45:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:45:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:45:58,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:45:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:58,437 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:45:58,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:45:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:45:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:45:58,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:58,438 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:45:58,438 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2019-08-05 10:45:58,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:58,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:45:58,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:59,037 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:59,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:59,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:45:59,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:45:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:45:59,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:59,039 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:46:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:00,534 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:46:00,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:46:00,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:46:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:00,535 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:46:00,535 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:46:00,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:46:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:46:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:46:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:46:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:46:00,540 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:46:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:00,540 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:46:00,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:46:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:46:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:46:00,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:00,541 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:46:00,541 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:00,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:00,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2019-08-05 10:46:00,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:00,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:46:00,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:01,026 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:46:01,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:01,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:46:01,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:46:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:46:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:46:01,027 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:46:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:02,670 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:46:02,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:46:02,670 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:46:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:02,671 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:46:02,671 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:46:02,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:46:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:46:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:46:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:46:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:46:02,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:46:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:02,677 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:46:02,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:46:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:46:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:46:02,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:02,678 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:46:02,678 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:02,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2019-08-05 10:46:02,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:02,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:46:02,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:03,191 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:46:03,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:03,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:46:03,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:46:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:46:03,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:46:03,193 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:46:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:04,897 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:46:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:46:04,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:46:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:04,898 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:46:04,898 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:46:04,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:46:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:46:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:46:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:46:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:46:04,903 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:46:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:04,904 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:46:04,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:46:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:46:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:46:04,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:04,906 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:46:04,906 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:04,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2019-08-05 10:46:04,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:04,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:46:04,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:05,519 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:46:05,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:05,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:46:05,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:46:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:46:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:46:05,520 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:46:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:07,510 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:46:07,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:46:07,513 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:46:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:07,513 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:46:07,513 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:46:07,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:46:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:46:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:46:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:46:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:46:07,518 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:46:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:07,518 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:46:07,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:46:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:46:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:46:07,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:07,519 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:46:07,519 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2019-08-05 10:46:07,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:07,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:46:07,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:08,793 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:46:08,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:08,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:46:08,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:46:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:46:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:46:08,794 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:46:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:10,717 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:46:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:46:10,718 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:46:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:10,719 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:46:10,719 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:46:10,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:46:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:46:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:46:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:46:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:46:10,723 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:46:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:10,723 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:46:10,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:46:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:46:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:46:10,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:10,724 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:46:10,724 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2019-08-05 10:46:10,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:10,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:46:10,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:12,328 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:46:12,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:12,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:46:12,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:46:12,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:46:12,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:46:12,330 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:46:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:14,372 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:46:14,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:46:14,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:46:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:14,373 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:46:14,373 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:46:14,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:46:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:46:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:46:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:46:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:46:14,378 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:46:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:14,378 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:46:14,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:46:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:46:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:46:14,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:14,379 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:46:14,379 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2019-08-05 10:46:14,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:14,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:46:14,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:15,035 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:46:15,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:15,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:46:15,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:46:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:46:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:46:15,038 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:46:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:17,446 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:46:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:46:17,447 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:46:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:17,448 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:46:17,448 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:46:17,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:46:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:46:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:46:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:46:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:46:17,453 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:46:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:17,453 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:46:17,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:46:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:46:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:46:17,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:17,454 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:46:17,454 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:17,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2019-08-05 10:46:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:17,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:46:17,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:18,322 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:46:18,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:18,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:46:18,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:46:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:46:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:46:18,324 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:46:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:20,688 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:46:20,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:46:20,688 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:46:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:20,689 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:46:20,689 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:46:20,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:46:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:46:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:46:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:46:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:46:20,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:46:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:20,693 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:46:20,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:46:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:46:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:46:20,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:20,694 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:46:20,694 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2019-08-05 10:46:20,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:20,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:46:20,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:21,370 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:46:21,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:21,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:46:21,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:46:21,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:46:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:46:21,372 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:46:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:23,925 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:46:23,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:46:23,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:46:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:23,927 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:46:23,927 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:46:23,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:46:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:46:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:46:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:46:23,930 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:46:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:23,931 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:46:23,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:46:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:46:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:46:23,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:23,932 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:46:23,932 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2019-08-05 10:46:23,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:23,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:46:23,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:24,662 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:46:24,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:24,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:46:24,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:46:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:46:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:46:24,663 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:46:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:27,433 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:46:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:46:27,433 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:46:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:27,434 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:46:27,434 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:46:27,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:46:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:46:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:46:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:46:27,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:46:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:27,436 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:46:27,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:46:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:46:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:46:27,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:27,437 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:46:27,437 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:27,437 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2019-08-05 10:46:27,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:27,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:46:27,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:28,213 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:46:28,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:28,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:46:28,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:46:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:46:28,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:46:28,214 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:46:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:31,030 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:46:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:46:31,031 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:46:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:31,031 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:46:31,031 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:46:31,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:46:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:46:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:46:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:46:31,035 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:46:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:31,035 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:46:31,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:46:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:46:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:46:31,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:31,036 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:46:31,036 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2019-08-05 10:46:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:31,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:46:31,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:32,079 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:46:32,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:32,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:46:32,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:46:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:46:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:46:32,080 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:46:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:35,127 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:46:35,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:46:35,127 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:46:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:35,128 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:46:35,128 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:46:35,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:46:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:46:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:46:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:46:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:46:35,131 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:46:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:35,132 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:46:35,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:46:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:46:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:46:35,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:35,133 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:46:35,133 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2019-08-05 10:46:35,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:35,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:46:35,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:36,136 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:46:36,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:36,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:46:36,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:46:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:46:36,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:46:36,138 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:46:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:39,420 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:46:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:46:39,420 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:46:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:39,421 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:46:39,421 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:46:39,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:46:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:46:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:46:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:46:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:46:39,425 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:46:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:39,425 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:46:39,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:46:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:46:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:46:39,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:39,426 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:46:39,426 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:39,426 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2019-08-05 10:46:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:39,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:46:39,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:40,306 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:46:40,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:40,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:46:40,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:46:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:46:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:46:40,307 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:46:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:43,827 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:46:43,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:46:43,827 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:46:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:43,828 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:46:43,828 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:46:43,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:46:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:46:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:46:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:46:43,831 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:46:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:43,832 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:46:43,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:46:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:46:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:46:43,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:43,833 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:46:43,833 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2019-08-05 10:46:43,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:43,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:46:43,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:44,800 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:46:44,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:44,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:46:44,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:46:44,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:46:44,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:46:44,801 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:46:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:48,532 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:46:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:46:48,533 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:46:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:48,533 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:46:48,534 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:46:48,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:46:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:46:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:46:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:46:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:46:48,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:46:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:48,537 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:46:48,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:46:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:46:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:46:48,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:48,537 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:46:48,537 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2019-08-05 10:46:48,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:48,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:46:48,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:49,528 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:49,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:49,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:46:49,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:46:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:46:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:46:49,530 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:46:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:53,497 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:46:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:46:53,497 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:46:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:53,498 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:46:53,498 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:46:53,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:46:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:46:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:46:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:46:53,501 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:46:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:53,501 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:46:53,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:46:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:46:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:46:53,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:53,502 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:46:53,502 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2019-08-05 10:46:53,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:53,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:46:53,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:54,628 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:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:54,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:46:54,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:46:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:46:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:46:54,629 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:46:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:58,786 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:46:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:46:58,786 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:46:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:58,787 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:46:58,787 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:46:58,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:46:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:46:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:46:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:46:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:46:58,790 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:46:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:58,791 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:46:58,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:46:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:46:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:46:58,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:58,792 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:46:58,792 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2019-08-05 10:46:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:58,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:46:58,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:59,775 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:59,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:59,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:46:59,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:46:59,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:46:59,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:46:59,777 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:47:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:04,162 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:47:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:47:04,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:47:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:04,163 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:47:04,163 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:47:04,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1981, Invalid=5851, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:47:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:47:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:47:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:47:04,166 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:47:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:04,167 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:47:04,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:47:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:47:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:47:04,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:04,167 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:47:04,168 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2019-08-05 10:47:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:04,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:47:04,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:05,243 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:47:05,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:05,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:47:05,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:47:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:47:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:47:05,244 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:47:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,905 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:47:09,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:47:09,906 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:47:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,907 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:47:09,907 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:47:09,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:47:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:47:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:47:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:47:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:47:09,910 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:47:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,910 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:47:09,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:47:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:47:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:47:09,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,911 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:47:09,911 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2019-08-05 10:47:09,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:11,053 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:47:11,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:11,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:47:11,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:47:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:47:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:47:11,054 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:47:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:16,039 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:47:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:47:16,039 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:47:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:16,040 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:47:16,040 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:47:16,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2163, Invalid=6393, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:47:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:47:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:47:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:47:16,043 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:47:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:16,043 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:47:16,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:47:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:47:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:47:16,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:16,044 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:47:16,044 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2019-08-05 10:47:16,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:16,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:47:16,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:17,227 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:47:17,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:17,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:47:17,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:47:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:47:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:47:17,228 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:47:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:22,255 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:47:22,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:47:22,256 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:47:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:22,257 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:47:22,257 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:47:22,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:47:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:47:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:47:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:47:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:47:22,259 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:47:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:22,259 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:47:22,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:47:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:47:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:47:22,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:22,259 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:47:22,260 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2019-08-05 10:47:22,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:22,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:47:22,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:23,458 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:47:23,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:23,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:47:23,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:47:23,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:47:23,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:47:23,459 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:47:23,605 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 8 [2019-08-05 10:47:23,729 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 9 [2019-08-05 10:47:23,862 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:47:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:28,908 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:47:28,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:47:28,909 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:47:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:28,910 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:47:28,910 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:47:28,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2353, Invalid=6959, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:47:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:47:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:47:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:47:28,913 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:47:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:28,913 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:47:28,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:47:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:47:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:47:28,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:28,914 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:47:28,915 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2019-08-05 10:47:28,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:28,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:47:28,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:30,208 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:47:30,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:30,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:47:30,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:47:30,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:47:30,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:47:30,209 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:47:30,577 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:47:30,705 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:47:30,845 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:47:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:35,909 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:47:35,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:47:35,910 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:47:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:35,911 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:47:35,911 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:47:35,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:47:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:47:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:47:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:47:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:47:35,914 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:47:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:35,915 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:47:35,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:47:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:47:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:47:35,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:35,915 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:47:35,916 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2019-08-05 10:47:35,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:36,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:47:36,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,382 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:47:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:37,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:47:37,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:47:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:47:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:47:37,383 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:47:37,666 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 9 [2019-08-05 10:47:37,788 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:47:37,914 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:47:38,049 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:47:38,178 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:47:38,311 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:47:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:43,451 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:47:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:47:43,451 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:47:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:43,452 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:47:43,452 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:47:43,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2551, Invalid=7549, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:47:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:47:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:47:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:47:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:47:43,456 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:47:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:43,456 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:47:43,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:47:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:47:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:47:43,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:43,457 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:47:43,457 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2019-08-05 10:47:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:43,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:47:43,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,163 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:47:45,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:47:45,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:47:45,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:47:45,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:47:45,165 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:47:45,316 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 8 [2019-08-05 10:47:45,435 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 9 [2019-08-05 10:47:45,556 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:47:45,692 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:47:45,821 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:47:45,960 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:47:46,110 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:47:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:51,680 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:47:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:47:51,680 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:47:51,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:51,681 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:47:51,681 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:47:51,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:47:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:47:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:47:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:47:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:47:51,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:47:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:51,684 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:47:51,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:47:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:47:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:47:51,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:51,685 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:47:51,685 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2019-08-05 10:47:51,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:51,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:47:51,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,158 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:47:53,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:47:53,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:47:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:47:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:53,159 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:47:53,299 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 8 [2019-08-05 10:47:53,421 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 9 [2019-08-05 10:47:53,548 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:47:53,678 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:47:53,812 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:47:53,943 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:47:54,080 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:47:54,234 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:47:54,387 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:47:54,559 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-05 10:47:56,942 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 11 [2019-08-05 10:47:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:59,940 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:47:59,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:47:59,940 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:47:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:59,941 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:47:59,941 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:47:59,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2757, Invalid=8163, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:47:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:47:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:47:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:47:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:47:59,944 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:47:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:59,945 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:47:59,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:47:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:47:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:47:59,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:59,945 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:47:59,946 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2019-08-05 10:47:59,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:00,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:48:00,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:01,397 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:48:01,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:01,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:48:01,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:48:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:48:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:48:01,398 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:48:01,690 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 9 [2019-08-05 10:48:01,822 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:48:01,958 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:48:02,096 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:48:02,229 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:48:02,511 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:48:02,803 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:48:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:08,185 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:48:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:48:08,185 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:48:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:08,186 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:48:08,186 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:48:08,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:48:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:48:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:48:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:48:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:48:08,190 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:48:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:08,190 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:48:08,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:48:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:48:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:48:08,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:08,191 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:48:08,191 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2019-08-05 10:48:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:08,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:48:08,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:10,051 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:48:10,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:10,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:48:10,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:48:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:48:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:48:10,052 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:48:10,190 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 8 [2019-08-05 10:48:10,320 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 9 [2019-08-05 10:48:10,452 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:48:10,585 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:48:10,718 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:48:10,850 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:48:10,986 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:48:11,127 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:48:11,272 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:48:11,420 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:48:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:17,046 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:48:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:48:17,046 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:48:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:17,047 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:48:17,047 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:48:17,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2971, Invalid=8801, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:48:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:48:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:48:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:48:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:48:17,050 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:48:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:17,050 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:48:17,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:48:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:48:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:48:17,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:17,051 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:48:17,051 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2019-08-05 10:48:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:17,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:48:17,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:18,620 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:48:18,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:18,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:48:18,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:48:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:48:18,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:48:18,622 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:48:18,763 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 8 [2019-08-05 10:48:18,892 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 9 [2019-08-05 10:48:19,025 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:48:19,168 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:48:19,303 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:48:19,439 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:48:19,590 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:48:19,734 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:48:19,902 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:48:20,067 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:48:20,233 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:48:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,122 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:48:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:48:26,123 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:48:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,124 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:48:26,124 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:48:26,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:48:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:48:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:48:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:48:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:48:26,127 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:48:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,127 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:48:26,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:48:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:48:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:48:26,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,128 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:48:26,128 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2019-08-05 10:48:26,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:27,731 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:48:27,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:27,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:48:27,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:48:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:48:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:48:27,732 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:48:27,891 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 8 [2019-08-05 10:48:28,025 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 9 [2019-08-05 10:48:28,171 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:48:28,316 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:48:28,463 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:48:28,613 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:48:28,756 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:48:28,901 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:48:29,049 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:48:29,197 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:48:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,499 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:48:35,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:48:35,499 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:48:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,500 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:48:35,500 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:48:35,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3193, Invalid=9463, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:48:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:48:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:48:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:48:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:48:35,502 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:48:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,503 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:48:35,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:48:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:48:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:48:35,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,503 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:48:35,503 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2019-08-05 10:48:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:37,190 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:48:37,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:37,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:48:37,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:48:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:48:37,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:48:37,192 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:48:37,348 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 8 [2019-08-05 10:48:37,487 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 9 [2019-08-05 10:48:37,633 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:48:37,778 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:48:37,927 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:48:38,083 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:48:38,231 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:48:38,379 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:48:38,533 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:48:38,682 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:48:38,848 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:48:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:45,149 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:48:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:48:45,150 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:48:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:45,150 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:48:45,151 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:48:45,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:48:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:48:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:48:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:48:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:48:45,154 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:48:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:45,154 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:48:45,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:48:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:48:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:48:45,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:45,155 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:48:45,155 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2019-08-05 10:48:45,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:45,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:48:45,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:47,268 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:48:47,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:47,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:48:47,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:48:47,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:48:47,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:48:47,269 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:48:47,421 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 8 [2019-08-05 10:48:47,559 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 9 [2019-08-05 10:48:47,704 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:48:47,856 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:48:48,020 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:48:48,172 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:48:48,324 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:48:48,480 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:48:48,644 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:48:48,803 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:48:48,964 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:48:49,123 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:48:49,285 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:48:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:55,932 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:48:55,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:48:55,932 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:48:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:55,933 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:48:55,933 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:48:55,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3423, Invalid=10149, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:48:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:48:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:48:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:48:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:48:55,936 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:48:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:55,937 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:48:55,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:48:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:48:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:48:55,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:55,937 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:48:55,937 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2019-08-05 10:48:55,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:56,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:48:56,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:57,744 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:48:57,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:57,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:48:57,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:48:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:48:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:48:57,746 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:48:57,910 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 8 [2019-08-05 10:48:58,061 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 9 [2019-08-05 10:48:58,217 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:48:58,374 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:48:58,525 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:48:58,682 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:48:58,839 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:48:58,998 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:48:59,156 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:48:59,312 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:48:59,477 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:48:59,639 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:49:01,283 WARN L188 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 11 [2019-08-05 10:49:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,920 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:49:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:49:06,920 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:49:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,921 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:49:06,921 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:49:06,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:49:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:49:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:49:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:49:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:49:06,924 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:49:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,924 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:49:06,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:49:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:49:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:49:06,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,925 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:49:06,925 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2019-08-05 10:49:06,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:49:08,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:49:08,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:49:08,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:08,889 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:49:09,055 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 8 [2019-08-05 10:49:09,203 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 9 [2019-08-05 10:49:09,360 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:49:09,519 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:49:09,677 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:49:09,827 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:49:09,981 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:49:10,139 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:49:10,300 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:49:10,466 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:49:10,631 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:49:10,800 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:49:10,962 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:49:11,182 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:49:11,382 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:49:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:18,042 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:49:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:49:18,043 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:49:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:18,043 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:49:18,044 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:49:18,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3661, Invalid=10859, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:49:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:49:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:49:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:49:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:49:18,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:49:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:18,047 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:49:18,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:49:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:49:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:49:18,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:18,048 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:49:18,048 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2019-08-05 10:49:18,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:18,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:49:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:19,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:19,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:49:19,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:49:19,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:49:19,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:19,946 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:49:20,125 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 8 [2019-08-05 10:49:20,279 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 9 [2019-08-05 10:49:20,442 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-05 10:49:20,609 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:49:20,782 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:49:20,950 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:49:21,114 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:49:21,297 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:49:21,496 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:49:21,685 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:49:21,856 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:49:22,029 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:49:22,199 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:49:22,549 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:49:23,466 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 11 [2019-08-05 10:49:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:29,451 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:49:29,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:49:29,451 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:49:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:29,452 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:49:29,452 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:49:29,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:49:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:49:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:49:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:49:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:49:29,456 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:49:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:29,456 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:49:29,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:49:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:49:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:49:29,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:29,457 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:49:29,457 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2019-08-05 10:49:29,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:29,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:49:29,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:31,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:31,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:49:31,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:49:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:49:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:49:31,412 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:49:31,610 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 8 [2019-08-05 10:49:31,785 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 9 [2019-08-05 10:49:31,945 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 11 [2019-08-05 10:49:32,108 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-05 10:49:32,274 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:49:32,436 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:49:32,600 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:49:32,765 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:49:32,940 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:49:33,120 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:49:33,296 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:49:33,470 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:49:33,644 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:49:33,817 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:49:34,002 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:49:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:41,202 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:49:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:49:41,203 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:49:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:41,204 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:49:41,204 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:49:41,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3907, Invalid=11593, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:49:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:49:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:49:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:49:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:49:41,207 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:49:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:41,207 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:49:41,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:49:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:49:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:49:41,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:41,208 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:49:41,208 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2019-08-05 10:49:41,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:41,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:49:41,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,917 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:49:43,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:49:43,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:49:43,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:49:43,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:49:43,918 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:49:44,098 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 8 [2019-08-05 10:49:44,258 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 9 [2019-08-05 10:49:44,428 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 11 [2019-08-05 10:49:44,595 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 11 [2019-08-05 10:49:44,765 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-05 10:49:44,929 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:49:45,100 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:49:45,263 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:49:45,440 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:49:45,612 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:49:45,787 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:49:45,962 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:49:46,135 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:49:46,318 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:49:46,506 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:49:46,705 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:49:46,905 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:49:47,118 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:49:47,510 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 Received shutdown request... [2019-08-05 10:49:49,607 WARN L196 SmtUtils]: Removed 5 from assertion stack [2019-08-05 10:49:49,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:49:49,608 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:49:49,612 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:49:49,612 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:49:49 BoogieIcfgContainer [2019-08-05 10:49:49,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:49:49,613 INFO L168 Benchmark]: Toolchain (without parser) took 255546.12 ms. Allocated memory was 133.2 MB in the beginning and 218.6 MB in the end (delta: 85.5 MB). Free memory was 110.8 MB in the beginning and 95.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:49,614 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.71 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:49:49,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.38 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 109.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:49,614 INFO L168 Benchmark]: Boogie Preprocessor took 18.94 ms. Allocated memory is still 133.2 MB. Free memory was 109.1 MB in the beginning and 107.8 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:49,615 INFO L168 Benchmark]: RCFGBuilder took 317.41 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 98.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:49,616 INFO L168 Benchmark]: TraceAbstraction took 255172.29 ms. Allocated memory was 133.2 MB in the beginning and 218.6 MB in the end (delta: 85.5 MB). Free memory was 98.2 MB in the beginning and 95.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 88.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:49,617 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.71 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.38 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 109.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.94 ms. Allocated memory is still 133.2 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.41 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 98.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255172.29 ms. Allocated memory was 133.2 MB in the beginning and 218.6 MB in the end (delta: 85.5 MB). Free memory was 98.2 MB in the beginning and 95.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 88.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (66states) and FLOYD_HOARE automaton (currently 32 states, 65 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 110 for 55ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 255.1s OverallTime, 63 OverallIterations, 62 TraceHistogramMax, 199.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 0 SDslu, 1953 SDs, 0 SdLazy, 4487 SolverSat, 1831 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3998 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3934 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38284 ImplicationChecksByTransitivity, 241.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 62 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 51.4s InterpolantComputationTime, 2142 NumberOfCodeBlocks, 2142 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 463783 SizeOfPredicates, 126 NumberOfNonLiveVariables, 7056 ConjunctsInSsa, 2144 ConjunctsInUnsatCore, 63 InterpolantComputations, 1 PerfectInterpolantSequences, 0/41664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown