java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:09,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:09,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:09,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:09,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:09,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:09,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:09,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:09,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:09,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:09,903 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:09,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:09,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:09,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:09,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:09,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:09,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:09,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:09,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:09,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:09,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:09,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:09,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:09,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:09,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:09,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:09,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:09,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:09,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:09,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:09,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:09,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:09,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:09,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:09,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:09,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:09,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:09,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:09,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:09,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:09,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:09,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:09,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:09,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:09,983 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:09,984 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:09,984 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl [2019-08-05 10:21:09,985 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl' [2019-08-05 10:21:10,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:10,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:10,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:10,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:10,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:10,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:10,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:10,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:10,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:10,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/1) ... [2019-08-05 10:21:10,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:10,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:10,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:10,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:10,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (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:21:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:10,419 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:10,419 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:21:10,421 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:10 BoogieIcfgContainer [2019-08-05 10:21:10,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:10,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:10,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:10,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:10,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:10" (1/2) ... [2019-08-05 10:21:10,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd4ce25 and model type simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:10, skipping insertion in model container [2019-08-05 10:21:10,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:10" (2/2) ... [2019-08-05 10:21:10,430 INFO L109 eAbstractionObserver]: Analyzing ICFG simple1.i_3.bpl [2019-08-05 10:21:10,441 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:10,449 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:10,466 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:10,501 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:10,501 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:10,502 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:10,502 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:10,502 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:10,502 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:10,502 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:10,503 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:10,503 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:21:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:21:10,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:10,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:21:10,547 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:21:10,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:10,723 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:21:10,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:10,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:10,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:10,749 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:21:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:10,786 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:21:10,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:10,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:21:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:10,799 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:21:10,800 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:21:10,802 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:21:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:21:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:21:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:21:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:21:10,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:21:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:10,837 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:21:10,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:21:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:21:10,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:10,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:21:10,839 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:21:10,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:10,994 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:21:10,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:10,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:21:10,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:10,998 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:21:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:11,105 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:21:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:11,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:21:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:11,108 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:21:11,108 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:21:11,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:21:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:21:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:21:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:21:11,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:21:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:11,112 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:21:11,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:21:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:21:11,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:11,113 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:21:11,113 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:21:11,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:11,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:11,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:11,231 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:21:11,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:11,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:11,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:11,233 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:21:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:11,315 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:21:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:11,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:21:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:11,318 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:21:11,319 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:21:11,319 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:21:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:21:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:21:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:21:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:21:11,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:21:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:11,325 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:21:11,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:21:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:21:11,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:11,326 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:21:11,326 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:21:11,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:11,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:21:11,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:11,449 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:21:11,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:11,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:11,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:11,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:11,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:11,451 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:21:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:11,496 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:21:11,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:11,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:21:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:11,499 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:21:11,499 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:21:11,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:21:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:21:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:21:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:21:11,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:21:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:11,503 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:21:11,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:21:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:21:11,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:11,513 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:21:11,514 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:21:11,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:11,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:21:11,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:11,679 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:21:11,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:11,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:11,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:11,681 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:21:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:11,870 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:21:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:11,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:21:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:11,872 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:21:11,872 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:21:11,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:21:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:21:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:21:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:21:11,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:21:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:11,875 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:21:11,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:21:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:21:11,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:11,876 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:21:11,876 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:21:11,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:11,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:21:11,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:12,052 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:21:12,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:12,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:12,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:12,054 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:21:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:12,170 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:21:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:12,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:21:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:12,172 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:21:12,172 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:21:12,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:21:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:21:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:21:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:21:12,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:21:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:12,176 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:21:12,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:21:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:21:12,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:12,177 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:21:12,177 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:12,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:21:12,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:12,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:21:12,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:12,388 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:21:12,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:12,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:12,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:12,390 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:21:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:12,481 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:21:12,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:12,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:21:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:12,482 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:21:12,483 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:21:12,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:21:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:21:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:21:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:21:12,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:21:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:12,486 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:21:12,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:21:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:21:12,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:12,487 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:21:12,487 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:21:12,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:12,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:21:12,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:12,906 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:21:12,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:12,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:12,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:12,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:12,908 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:21:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:12,998 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:21:12,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:12,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:21:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:13,000 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:21:13,000 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:21:13,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:21:13,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:21:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:21:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:21:13,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:21:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:13,004 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:21:13,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:21:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:21:13,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:13,005 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:21:13,006 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:21:13,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:13,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:21:13,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:13,206 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:21:13,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:13,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:13,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:13,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:13,208 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:21:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:13,308 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:21:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:13,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:21:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:13,309 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:21:13,310 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:21:13,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:21:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:21:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:21:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:21:13,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:21:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:13,314 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:21:13,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:21:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:21:13,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:13,315 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:21:13,315 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:21:13,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:13,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:21:13,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:13,621 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:21:13,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:13,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:13,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:21:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:21:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:13,629 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:21:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:13,826 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:21:13,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:21:13,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:21:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:13,828 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:21:13,828 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:21:13,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:21:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:21:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:21:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:21:13,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:21:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:13,832 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:21:13,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:21:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:21:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:21:13,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:13,833 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:21:13,833 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:13,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:21:13,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:13,853 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:21:13,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:14,098 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:21:14,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:14,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:21:14,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:21:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:21:14,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:14,101 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:21:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:14,284 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:21:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:21:14,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:21:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:14,285 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:21:14,286 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:21:14,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:21:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:21:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:21:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:21:14,290 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:21:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:14,290 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:21:14,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:21:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:21:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:21:14,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:14,291 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:21:14,292 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:14,292 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:21:14,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:14,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:21:14,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:14,496 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:21:14,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:21:14,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:21:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:21:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:14,497 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:21:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:14,634 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:21:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:21:14,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:21:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:14,636 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:21:14,636 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:21:14,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:21:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:21:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:21:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:21:14,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:21:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:14,640 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:21:14,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:21:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:21:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:21:14,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:14,640 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:21:14,641 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:21:14,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:14,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:21:14,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:14,869 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:21:14,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:14,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:21:14,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:21:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:21:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:14,871 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:21:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:15,066 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:21:15,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:21:15,071 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:21:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:15,072 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:21:15,072 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:21:15,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:21:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:21:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:21:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:21:15,078 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:21:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:15,078 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:21:15,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:21:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:21:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:21:15,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:15,080 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:21:15,080 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:15,081 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:21:15,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:15,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:21:15,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:15,297 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:21:15,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:15,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:21:15,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:21:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:21:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:15,298 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:21:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:15,486 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:21:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:21:15,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:21:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:15,488 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:21:15,488 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:21:15,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:21:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:21:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:21:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:21:15,492 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:21:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:15,493 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:21:15,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:21:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:21:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:21:15,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:15,494 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:21:15,494 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:21:15,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:15,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:21:15,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:15,792 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:21:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:21:15,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:21:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:21:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:15,795 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:21:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:16,008 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:21:16,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:21:16,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:21:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:16,009 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:21:16,009 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:21:16,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:21:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:21:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:21:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:21:16,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:21:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:16,014 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:21:16,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:21:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:21:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:21:16,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:16,015 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:21:16,015 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:21:16,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:16,030 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:21:16,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:16,579 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:21:16,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:16,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:21:16,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:21:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:21:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:16,582 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:21:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:17,237 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:21:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:21:17,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:21:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:17,239 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:21:17,239 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:21:17,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:21:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:21:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:21:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:21:17,243 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:21:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:17,243 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:21:17,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:21:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:21:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:21:17,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:17,244 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:21:17,244 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:21:17,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:17,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:21:17,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:17,725 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:21:17,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:17,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:21:17,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:21:17,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:21:17,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:17,727 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:21:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:18,001 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:21:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:21:18,001 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:21:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:18,002 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:21:18,002 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:21:18,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:21:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:21:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:21:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:21:18,005 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:21:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:18,006 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:21:18,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:21:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:21:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:21:18,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:18,007 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:21:18,007 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:21:18,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:18,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:21:18,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:18,653 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:21:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:18,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:21:18,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:21:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:21:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:18,656 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:21:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:19,017 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:21:19,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:21:19,018 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:21:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:19,019 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:21:19,019 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:21:19,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:21:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:21:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:21:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:21:19,023 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:21:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:19,024 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:21:19,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:21:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:21:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:21:19,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:19,024 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:21:19,025 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:21:19,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:19,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:21:19,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:19,325 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:21:19,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:19,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:21:19,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:21:19,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:21:19,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:19,326 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:21:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:19,673 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:21:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:21:19,674 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:21:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:19,675 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:21:19,675 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:21:19,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:21:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:21:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:21:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:21:19,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:21:19,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:19,680 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:21:19,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:21:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:21:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:21:19,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:19,681 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:21:19,681 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:21:19,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:19,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:21:19,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:19,924 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:21:19,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:19,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:21:19,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:21:19,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:21:19,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:19,926 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:21:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:20,268 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:21:20,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:21:20,269 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:21:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:20,269 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:21:20,270 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:21:20,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:21:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:21:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:21:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:21:20,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:21:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:20,275 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:21:20,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:21:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:21:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:21:20,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:20,276 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:21:20,276 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:21:20,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:20,291 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:21:20,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:20,606 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:21:20,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:20,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:21:20,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:21:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:21:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:20,609 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:21:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:21,011 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:21:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:21:21,011 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:21:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:21,012 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:21:21,012 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:21:21,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:21:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:21:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:21:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:21:21,017 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:21:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:21,017 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:21:21,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:21:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:21:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:21:21,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:21,018 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:21:21,019 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:21:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:21,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:21:21,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:21,585 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:21:21,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:21,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:21:21,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:21:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:21:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:21:21,587 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:21:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:22,141 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:21:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:21:22,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:21:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:22,144 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:21:22,144 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:21:22,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:21:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:21:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:21:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:21:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:21:22,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:21:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:22,148 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:21:22,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:21:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:21:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:21:22,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:22,149 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:21:22,149 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:21:22,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:22,164 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:21:22,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:22,486 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:21:22,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:22,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:21:22,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:21:22,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:21:22,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:21:22,489 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:21:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:23,359 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:21:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:21:23,361 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:21:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:23,361 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:21:23,362 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:21:23,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:21:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:21:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:21:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:21:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:21:23,365 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:21:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:23,366 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:21:23,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:21:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:21:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:21:23,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:23,367 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:21:23,367 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:21:23,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:23,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:21:23,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:23,669 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:21:23,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:23,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:21:23,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:21:23,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:21:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:21:23,671 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:21:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:24,351 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:21:24,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:21:24,352 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:21:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:24,352 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:21:24,353 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:21:24,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:21:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:21:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:21:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:21:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:21:24,357 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:21:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:24,357 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:21:24,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:21:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:21:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:21:24,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:24,358 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:21:24,359 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:24,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:21:24,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:24,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:21:24,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:24,749 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:21:24,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:24,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:21:24,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:21:24,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:21:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:21:24,751 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:21:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:25,252 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:21:25,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:21:25,253 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:21:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:25,253 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:21:25,254 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:21:25,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:21:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:21:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:21:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:21:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:21:25,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:21:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:25,259 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:21:25,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:21:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:21:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:21:25,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:25,260 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:21:25,260 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:21:25,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:25,275 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:21:25,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:25,601 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:21:25,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:25,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:21:25,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:21:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:21:25,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:21:25,603 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:21:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:26,177 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:21:26,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:21:26,178 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:21:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:26,179 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:21:26,179 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:21:26,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:21:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:21:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:21:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:21:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:21:26,183 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:21:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:26,183 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:21:26,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:21:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:21:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:21:26,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:26,184 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:21:26,185 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:21:26,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:26,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:21:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:26,818 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:21:26,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:26,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:21:26,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:21:26,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:21:26,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:21:26,820 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:21:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:27,515 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:21:27,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:21:27,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:21:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:27,516 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:21:27,516 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:21:27,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:21:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:21:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:21:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:21:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:21:27,520 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:21:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:27,521 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:21:27,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:21:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:21:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:21:27,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,522 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:21:27,522 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,522 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:21:27,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:27,538 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:21:27,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:27,926 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:21:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:27,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:21:27,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:21:27,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:21:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:21:27,928 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:21:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:28,543 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:21:28,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:21:28,544 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:21:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:28,545 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:21:28,545 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:21:28,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:21:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:21:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:21:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:21:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:21:28,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:21:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:28,549 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:21:28,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:21:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:21:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:21:28,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:28,550 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:21:28,550 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:28,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:21:28,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:28,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:21:28,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,936 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:21:28,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:21:28,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:21:28,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:21:28,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:21:28,937 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:21:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:29,600 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:21:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:21:29,600 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:21:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:29,601 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:21:29,601 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:21:29,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:21:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:21:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:21:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:21:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:21:29,605 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:21:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:29,606 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:21:29,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:21:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:21:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:21:29,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:29,606 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:21:29,607 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:29,607 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:21:29,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:29,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:21:29,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:30,196 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:21:30,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:21:30,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:21:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:21:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:21:30,197 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:21:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:30,918 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:21:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:21:30,919 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:21:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:30,920 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:21:30,920 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:21:30,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:21:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:21:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:21:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:21:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:21:30,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:21:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:30,924 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:21:30,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:21:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:21:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:21:30,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:30,925 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:21:30,925 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:21:30,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:30,942 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:21:30,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:31,471 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:21:31,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:31,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:21:31,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:21:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:21:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:21:31,472 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:21:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:32,258 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:21:32,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:21:32,258 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:21:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:32,259 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:21:32,259 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:21:32,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:21:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:21:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:21:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:21:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:21:32,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:21:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:32,264 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:21:32,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:21:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:21:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:21:32,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:32,264 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:21:32,265 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:21:32,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:32,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:21:32,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:32,898 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:21:32,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:32,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:21:32,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:21:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:21:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:21:32,900 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:21:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,707 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:21:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:21:33,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:21:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,712 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:21:33,713 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:21:33,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:21:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:21:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:21:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:21:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:21:33,716 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:21:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,716 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:21:33,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:21:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:21:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:21:33,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,717 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:21:33,717 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:21:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,223 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:21:34,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:21:34,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:21:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:21:34,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:21:34,225 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:21:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:35,081 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:21:35,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:21:35,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:21:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:35,082 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:21:35,082 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:21:35,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:21:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:21:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:21:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:21:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:21:35,087 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:21:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:35,087 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:21:35,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:21:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:21:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:21:35,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:35,088 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:21:35,088 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:21:35,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:35,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:21:35,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:36,404 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:21:36,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:36,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:21:36,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:21:36,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:21:36,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:21:36,406 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:21:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:37,364 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:21:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:21:37,364 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:21:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:37,365 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:21:37,365 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:21:37,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:21:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:21:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:21:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:21:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:21:37,369 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:21:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:37,369 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:21:37,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:21:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:21:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:21:37,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:37,370 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:21:37,370 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:21:37,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:37,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:21:37,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:38,812 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:21:38,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:38,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:21:38,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:21:38,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:21:38,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:21:38,813 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:21:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:39,780 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:21:39,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:21:39,780 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:21:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:39,781 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:21:39,781 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:21:39,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:21:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:21:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:21:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:21:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:21:39,786 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:21:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:39,786 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:21:39,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:21:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:21:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:21:39,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:39,787 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:21:39,787 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:21:39,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:39,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:21:39,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:41,392 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:21:41,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:41,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:21:41,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:21:41,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:21:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:21:41,394 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:21:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:42,439 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:21:42,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:21:42,439 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:21:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:42,440 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:21:42,440 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:21:42,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:21:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:21:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:21:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:21:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:21:42,443 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:21:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:42,444 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:21:42,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:21:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:21:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:21:42,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:42,444 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:21:42,444 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:21:42,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:42,463 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:21:42,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:43,203 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:21:43,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:43,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:21:43,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:21:43,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:21:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:21:43,205 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:21:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:44,267 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:21:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:21:44,267 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:21:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:44,268 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:21:44,268 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:21:44,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:21:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:21:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:21:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:21:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:21:44,270 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:21:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:44,271 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:21:44,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:21:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:21:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:21:44,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:44,272 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:21:44,272 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:44,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:21:44,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:44,291 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:21:44,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:45,053 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:21:45,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:45,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:21:45,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:21:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:21:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:21:45,056 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:21:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,183 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:21:46,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:21:46,184 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:21:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,185 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:21:46,185 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:21:46,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:21:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:21:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:21:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:21:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:21:46,188 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:21:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,188 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:21:46,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:21:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:21:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:21:46,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:46,189 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:21:46,189 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:46,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:21:46,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,918 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:21:46,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:46,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:21:46,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:21:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:21:46,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:21:46,920 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:21:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,240 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:21:48,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:21:48,240 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:21:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,241 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:21:48,241 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:21:48,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:21:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:21:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:21:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:21:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:21:48,245 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:21:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,245 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:21:48,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:21:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:21:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:21:48,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,246 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:21:48,246 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:21:48,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,266 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,936 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:21:48,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:21:48,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:21:48,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:21:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:21:48,938 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:21:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,216 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:21:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:21:50,217 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:21:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,218 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:21:50,218 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:21:50,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:21:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:21:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:21:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:21:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:21:50,221 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:21:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,221 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:21:50,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:21:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:21:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:21:50,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,222 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:21:50,222 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:21:50,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,952 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:21:50,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:21:50,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:21:50,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:21:50,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:21:50,954 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:21:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,269 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:21:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:21:52,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:21:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,271 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:21:52,271 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:21:52,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:21:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:21:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:21:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:21:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:21:52,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:21:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,274 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:21:52,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:21:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:21:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:21:52,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,274 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:21:52,274 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:21:52,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,342 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:21:53,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:53,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:21:53,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:21:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:21:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:21:53,344 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:21:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:54,722 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:21:54,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:21:54,722 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:21:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:54,723 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:21:54,723 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:21:54,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:21:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:21:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:21:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:21:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:21:54,726 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:21:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:54,726 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:21:54,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:21:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:21:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:21:54,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:54,727 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:21:54,727 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:21:54,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:54,749 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:21:54,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:55,564 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:21:55,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:55,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:21:55,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:21:55,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:21:55,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:21:55,566 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:21:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:56,990 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:21:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:21:56,991 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:21:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:56,992 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:21:56,992 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:21:56,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:21:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:21:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:21:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:21:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:21:56,996 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:21:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:56,996 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:21:56,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:21:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:21:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:21:57,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:57,001 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:21:57,002 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:21:57,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:57,024 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:21:57,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:58,044 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:21:58,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:58,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:21:58,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:21:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:21:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:21:58,046 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:21:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:59,577 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:21:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:21:59,577 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:21:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:59,578 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:21:59,578 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:21:59,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:21:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:21:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:21:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:21:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:21:59,581 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:21:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:59,582 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:21:59,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:21:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:21:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:21:59,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:59,583 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:21:59,583 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:59,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:21:59,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:59,606 WARN L254 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:21:59,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:00,757 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:22:00,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:00,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:22:00,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:22:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:22:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:00,758 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:22:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:02,309 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:22:02,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:22:02,309 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:22:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:02,310 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:22:02,310 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:22:02,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:22:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:22:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:22:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:22:02,313 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:22:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:02,314 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:22:02,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:22:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:22:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:22:02,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:02,314 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:22:02,315 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:22:02,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:02,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:22:02,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:03,516 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:22:03,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:03,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:22:03,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:22:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:22:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:22:03,518 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:22:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:05,138 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:22:05,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:22:05,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:22:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:05,140 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:22:05,140 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:22:05,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:22:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:22:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:22:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:22:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:22:05,142 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:22:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:05,143 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:22:05,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:22:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:22:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:22:05,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:05,144 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:22:05,144 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:05,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:22:05,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:05,168 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:22:05,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,046 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:22:06,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:06,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:22:06,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:22:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:22:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:06,047 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:22:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:07,750 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:22:07,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:22:07,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:22:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:07,751 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:22:07,752 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:22:07,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:22:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:22:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:22:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:22:07,754 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:22:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:07,754 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:22:07,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:22:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:22:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:22:07,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:07,755 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:22:07,755 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:22:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:07,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:22:07,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:09,144 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:22:09,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:09,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:22:09,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:22:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:22:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:22:09,145 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:22:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:10,915 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:22:10,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:22:10,916 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:22:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:10,917 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:22:10,917 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:22:10,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:22:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:22:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:22:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:22:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:22:10,920 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:22:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:10,921 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:22:10,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:22:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:22:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:22:10,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:10,921 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:22:10,922 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:10,922 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:22:10,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:10,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:22:10,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:11,978 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:22:11,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:11,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:22:11,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:22:11,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:22:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:11,980 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:22:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:13,949 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:22:13,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:22:13,950 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:22:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:13,951 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:22:13,951 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:22:13,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:22:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:22:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:22:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:22:13,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:22:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:13,955 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:22:13,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:22:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:22:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:22:13,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:13,956 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:22:13,956 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:22:13,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:13,983 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:22:13,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:15,155 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:22:15,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:15,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:22:15,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:22:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:22:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:22:15,157 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:22:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:17,086 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:22:17,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:22:17,087 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:22:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:17,088 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:22:17,088 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:22:17,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:22:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:22:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:22:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:22:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:22:17,091 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:22:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:17,091 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:22:17,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:22:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:22:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:22:17,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:17,093 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:22:17,093 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:22:17,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:17,119 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:22:17,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:18,216 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:22:18,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:18,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:22:18,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:22:18,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:22:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:22:18,218 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:22:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:20,344 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:22:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:22:20,344 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:22:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:20,346 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:22:20,346 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:22:20,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:22:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:22:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:22:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:22:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:22:20,348 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:22:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:20,348 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:22:20,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:22:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:22:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:22:20,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:20,349 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:22:20,349 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:22:20,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:20,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:22:20,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:21,542 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:22:21,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:21,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:22:21,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:22:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:22:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:22:21,543 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:22:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:23,781 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:22:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:22:23,781 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:22:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:23,782 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:22:23,782 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:22:23,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:22:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:22:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:22:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:22:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:22:23,785 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:22:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:23,785 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:22:23,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:22:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:22:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:22:23,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:23,786 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:22:23,786 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:22:23,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:23,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:22:23,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:24,913 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:22:24,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:24,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:22:24,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:22:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:22:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:22:24,915 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:22:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:27,073 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:22:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:22:27,073 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:22:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:27,074 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:22:27,074 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:22:27,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:22:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:22:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:22:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:22:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:22:27,078 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:22:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:27,078 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:22:27,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:22:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:22:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:22:27,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:27,079 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:22:27,079 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:22:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:27,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:22:27,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:28,234 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:22:28,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:28,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:22:28,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:22:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:22:28,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:22:28,236 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:22:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:30,616 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:22:30,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:22:30,617 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:22:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:30,618 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:22:30,618 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:22:30,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:22:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:22:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:22:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:22:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:22:30,621 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:22:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:30,621 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:22:30,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:22:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:22:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:22:30,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:30,622 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:22:30,622 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:30,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:22:30,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:30,652 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:22:30,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:32,034 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:22:32,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:32,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:22:32,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:22:32,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:22:32,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:22:32,035 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:22:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:34,473 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:22:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:22:34,474 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:22:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:34,475 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:22:34,475 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:22:34,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:22:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:22:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:22:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:22:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:22:34,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:22:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:34,478 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:22:34,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:22:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:22:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:22:34,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:34,478 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:22:34,479 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:34,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:22:34,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:34,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:22:34,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:35,828 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:22:35,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:35,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:22:35,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:22:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:22:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:22:35,829 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:22:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:38,228 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:22:38,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:22:38,229 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:22:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:38,230 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:22:38,230 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:22:38,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:22:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:22:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:22:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:22:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:22:38,233 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:22:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:38,233 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:22:38,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:22:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:22:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:22:38,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:38,234 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:22:38,234 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:22:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:38,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:22:38,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:39,704 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:22:39,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:39,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:22:39,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:22:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:22:39,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:22:39,706 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:22:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:42,176 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:22:42,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:22:42,177 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:22:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:42,178 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:22:42,178 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:22:42,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:22:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:22:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:22:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:22:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:22:42,181 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:22:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:42,181 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:22:42,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:22:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:22:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:22:42,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:42,182 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:22:42,182 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:42,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:22:42,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:42,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:22:42,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:43,537 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:22:43,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:43,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:22:43,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:22:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:22:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:22:43,538 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:22:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:46,195 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:22:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:22:46,195 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:22:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:46,196 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:22:46,196 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:22:46,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:22:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:22:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:22:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:22:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:22:46,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:22:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:46,200 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:22:46,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:22:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:22:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:22:46,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:46,201 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:22:46,201 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:46,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:22:46,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:46,235 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:22:46,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:47,859 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:22:47,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:47,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:22:47,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:22:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:22:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:22:47,860 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:22:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:50,607 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:22:50,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:22:50,608 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:22:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:50,609 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:22:50,609 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:22:50,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:22:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:22:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:22:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:22:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:22:50,612 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:22:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:50,612 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:22:50,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:22:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:22:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:22:50,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:50,613 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:22:50,614 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:22:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:50,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:22:50,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:52,083 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:22:52,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:52,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:22:52,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:22:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:22:52,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:22:52,084 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:22:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:54,951 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:22:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:22:54,951 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:22:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:54,952 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:22:54,952 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:22:54,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:22:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:22:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:22:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:22:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:22:54,955 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:22:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:54,956 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:22:54,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:22:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:22:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:22:54,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:54,956 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:22:54,957 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:22:54,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:54,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:22:54,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:56,450 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:22:56,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:56,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:22:56,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:22:56,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:22:56,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:22:56,451 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:22:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:59,373 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:22:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:22:59,373 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:22:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:59,374 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:22:59,374 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:22:59,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:22:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:22:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:22:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:22:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:22:59,377 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:22:59,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:59,377 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:22:59,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:22:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:22:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:22:59,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:59,378 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:22:59,378 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:59,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:22:59,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:59,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:22:59,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:00,971 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:23:00,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:00,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:23:00,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:23:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:23:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:23:00,973 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:23:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:03,886 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:23:03,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:23:03,886 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:23:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:03,887 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:23:03,887 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:23:03,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:23:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:23:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:23:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:23:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:23:03,890 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:23:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:03,890 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:23:03,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:23:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:23:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:23:03,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:03,891 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:23:03,891 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:23:03,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:03,928 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:23:03,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:06,155 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:23:06,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:06,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:23:06,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:23:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:23:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:23:06,157 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:23:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:09,174 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:23:09,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:23:09,174 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:23:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:09,175 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:23:09,175 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:23:09,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:23:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:23:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:23:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:23:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:23:09,178 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:23:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:09,179 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:23:09,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:23:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:23:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:23:09,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:09,180 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:23:09,180 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:23:09,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:09,219 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:23:09,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:11,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:11,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:23:11,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:23:11,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:23:11,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:23:11,151 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:23:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:14,262 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:23:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:23:14,263 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:23:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:14,263 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:23:14,264 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:23:14,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:23:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:23:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:23:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:23:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:23:14,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:23:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:14,268 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:23:14,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:23:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:23:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:23:14,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:14,269 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:23:14,269 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:14,269 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:23:14,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:14,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:23:14,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:16,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:23:16,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:23:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:23:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:23:16,182 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:23:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:19,397 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:23:19,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:23:19,398 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:23:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:19,399 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:23:19,399 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:23:19,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:23:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:23:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:23:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:23:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:23:19,402 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:23:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:19,402 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:23:19,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:23:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:23:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:23:19,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:19,403 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:23:19,404 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:23:19,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:19,437 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:23:19,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:21,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:21,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:23:21,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:23:21,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:23:21,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:23:21,297 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:23:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:24,613 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:23:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:23:24,614 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:23:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:24,615 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:23:24,615 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:23:24,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:23:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:23:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:23:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:23:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:23:24,617 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:23:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:24,618 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:23:24,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:23:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:23:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:23:24,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:24,618 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:23:24,618 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:23:24,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:24,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:23:24,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:26,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:26,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:23:26,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:23:26,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:23:26,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:23:26,666 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:23:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:30,202 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:23:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:23:30,202 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:23:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:30,203 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:23:30,203 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:23:30,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:23:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:23:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:23:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:23:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:23:30,207 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:23:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:30,207 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:23:30,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:23:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:23:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:23:30,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:30,208 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:23:30,209 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:30,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:23:30,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:30,249 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:23:30,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:32,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:32,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:23:32,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:23:32,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:23:32,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:23:32,005 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:23:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:35,638 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:23:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:23:35,638 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:23:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:35,639 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:23:35,639 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:23:35,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:23:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:23:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:23:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:23:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:23:35,642 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:23:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:35,643 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:23:35,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:23:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:23:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:23:35,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:35,644 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:23:35,644 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:23:35,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:35,684 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:23:35,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:37,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:23:37,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:23:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:23:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:23:37,517 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:23:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:41,252 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:23:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:23:41,253 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:23:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:41,254 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:23:41,254 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:23:41,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:23:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:23:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:23:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:23:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:23:41,256 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:23:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:41,257 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:23:41,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:23:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:23:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:23:41,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:41,258 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:23:41,259 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:23:41,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:41,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:23:41,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:43,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:43,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:23:43,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:23:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:23:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:23:43,220 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:23:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:47,070 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:23:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:23:47,071 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:23:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:47,072 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:23:47,072 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:23:47,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:23:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:23:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:23:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:23:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:23:47,075 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:23:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:47,075 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:23:47,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:23:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:23:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:23:47,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:47,076 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:23:47,077 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:23:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:47,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:23:47,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:49,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:49,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:23:49,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:23:49,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:23:49,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:23:49,257 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:23:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:53,227 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:23:53,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:23:53,228 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:23:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:53,229 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:23:53,229 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:23:53,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:23:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:23:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:23:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:23:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:23:53,232 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:23:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:53,233 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:23:53,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:23:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:23:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:23:53,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:53,234 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:23:53,234 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:53,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:23:53,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:53,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:23:53,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:55,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:55,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:23:55,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:23:55,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:23:55,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:23:55,986 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:23:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:59,899 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:23:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:23:59,899 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:23:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:59,900 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:23:59,901 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:23:59,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:23:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:23:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:23:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:23:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:23:59,904 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:23:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:59,904 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:23:59,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:23:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:23:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:23:59,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:59,905 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:23:59,905 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:23:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:59,955 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:23:59,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:02,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:02,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:24:02,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:24:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:24:02,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:24:02,417 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:24:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:06,560 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:24:06,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:24:06,561 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:24:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:06,562 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:24:06,562 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:24:06,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:24:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:24:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:24:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:24:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:24:06,565 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:24:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:06,565 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:24:06,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:24:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:24:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:24:06,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:06,566 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:24:06,566 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:06,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:06,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:24:06,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:06,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:24:06,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:08,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:08,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:24:08,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:24:08,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:24:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:24:08,711 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:24:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:12,915 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:24:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:24:12,917 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:24:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:12,918 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:24:12,918 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:24:12,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:24:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:24:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:24:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:24:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:24:12,920 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:24:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:12,921 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:24:12,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:24:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:24:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:24:12,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:12,921 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:24:12,922 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:24:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:12,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:24:12,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:15,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:15,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:24:15,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:24:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:24:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:24:15,124 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:24:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:19,448 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:24:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:24:19,449 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:24:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:19,450 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:24:19,450 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:24:19,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:24:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:24:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:24:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:24:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:24:19,458 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:24:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:19,458 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:24:19,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:24:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:24:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:24:19,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:19,459 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:24:19,459 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:24:19,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:19,497 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:24:19,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:21,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:21,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:24:21,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:24:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:24:21,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:24:21,965 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:24:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:26,337 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:24:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:24:26,337 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:24:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:26,338 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:24:26,338 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:24:26,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:24:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:24:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:24:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:24:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:24:26,341 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:24:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:26,342 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:24:26,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:24:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:24:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:24:26,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:26,343 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:24:26,343 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:24:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:26,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:24:26,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:28,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:28,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:24:28,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:24:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:24:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:24:28,776 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:24:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:33,373 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:24:33,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:24:33,373 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:24:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:33,374 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:24:33,374 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:24:33,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:24:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:24:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:24:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:24:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:24:33,377 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:24:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:33,378 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:24:33,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:24:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:24:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:24:33,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:33,378 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:24:33,378 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:24:33,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:33,425 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:24:33,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:35,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:35,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:24:35,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:24:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:24:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:24:35,732 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:24:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:40,870 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:24:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:24:40,871 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:24:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:40,872 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:24:40,872 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:24:40,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:24:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:24:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:24:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:24:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:24:40,875 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:24:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:40,876 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:24:40,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:24:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:24:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:24:40,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:40,877 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:24:40,877 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:24:40,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:40,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:24:40,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:43,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:43,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:24:43,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:24:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:24:43,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:24:43,534 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:24:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:48,365 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:24:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:24:48,365 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:24:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:48,366 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:24:48,366 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:24:48,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:24:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:24:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:24:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:24:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:24:48,370 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:24:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:48,370 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:24:48,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:24:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:24:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:24:48,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:48,371 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:24:48,372 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:24:48,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:48,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:24:48,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:50,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:50,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:24:50,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:24:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:24:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:24:50,882 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:24:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:55,919 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:24:55,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:24:55,919 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:24:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:55,920 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:24:55,920 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:24:55,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:24:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:24:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:24:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:24:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:24:55,923 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:24:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:55,923 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:24:55,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:24:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:24:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:24:55,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:55,924 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:24:55,924 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:24:55,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:55,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:24:55,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:59,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:59,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:24:59,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:24:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:24:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:24:59,655 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:25:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:04,840 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:25:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:25:04,840 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:25:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:04,841 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:25:04,841 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:25:04,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:25:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:25:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:25:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:25:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:25:04,844 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:25:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:04,844 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:25:04,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:25:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:25:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:25:04,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:04,845 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:25:04,846 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:25:04,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:04,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:25:04,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:07,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:07,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:25:07,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:25:07,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:25:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:25:07,761 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:25:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:12,914 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:25:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:25:12,914 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:25:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:12,915 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:25:12,915 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:25:12,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:25:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:25:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:25:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:25:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:25:12,918 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:25:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:12,919 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:25:12,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:25:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:25:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:25:12,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:12,920 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:25:12,920 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:25:12,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:12,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 10:25:12,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:25:16,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:25:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:25:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:25:16,843 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. Received shutdown request... [2019-08-05 10:25:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:25:19,637 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:25:19,644 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:25:19,645 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:25:19 BoogieIcfgContainer [2019-08-05 10:25:19,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:25:19,647 INFO L168 Benchmark]: Toolchain (without parser) took 249623.44 ms. Allocated memory was 135.8 MB in the beginning and 213.4 MB in the end (delta: 77.6 MB). Free memory was 113.4 MB in the beginning and 66.3 MB in the end (delta: 47.1 MB). Peak memory consumption was 124.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:19,647 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory is still 114.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:25:19,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.14 ms. Allocated memory is still 135.8 MB. Free memory was 113.0 MB in the beginning and 111.7 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:25:19,649 INFO L168 Benchmark]: Boogie Preprocessor took 20.83 ms. Allocated memory is still 135.8 MB. Free memory was 111.3 MB in the beginning and 110.4 MB in the end (delta: 900.4 kB). Peak memory consumption was 900.4 kB. Max. memory is 7.1 GB. [2019-08-05 10:25:19,649 INFO L168 Benchmark]: RCFGBuilder took 341.57 ms. Allocated memory is still 135.8 MB. Free memory was 110.4 MB in the beginning and 101.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:19,650 INFO L168 Benchmark]: TraceAbstraction took 249222.34 ms. Allocated memory was 135.8 MB in the beginning and 213.4 MB in the end (delta: 77.6 MB). Free memory was 100.8 MB in the beginning and 66.3 MB in the end (delta: 34.5 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:19,653 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.21 ms. Allocated memory is still 135.8 MB. Free memory is still 114.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.14 ms. Allocated memory is still 135.8 MB. Free memory was 113.0 MB in the beginning and 111.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.83 ms. Allocated memory is still 135.8 MB. Free memory was 111.3 MB in the beginning and 110.4 MB in the end (delta: 900.4 kB). Peak memory consumption was 900.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 341.57 ms. Allocated memory is still 135.8 MB. Free memory was 110.4 MB in the beginning and 101.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249222.34 ms. Allocated memory was 135.8 MB in the beginning and 213.4 MB in the end (delta: 77.6 MB). Free memory was 100.8 MB in the beginning and 66.3 MB in the end (delta: 34.5 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (86states) and FLOYD_HOARE automaton (currently 46 states, 85 states before enhancement),while ReachableStatesComputation was computing reachable states (44 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.1s OverallTime, 83 OverallIterations, 82 TraceHistogramMax, 152.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 0 SDslu, 3403 SDs, 0 SdLazy, 197622 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 82 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 94.4s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 83 NumberOfNonLiveVariables, 11205 ConjunctsInSsa, 7055 ConjunctsInUnsatCore, 83 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown