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/abstractInterpretation/regression/non_taipan/loop-skips-unsafe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:12:26,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:12:26,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:12:26,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:12:26,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:12:26,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:12:26,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:12:26,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:12:26,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:12:26,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:12:26,764 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:12:26,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:12:26,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:12:26,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:12:26,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:12:26,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:12:26,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:12:26,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:12:26,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:12:26,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:12:26,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:12:26,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:12:26,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:12:26,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:12:26,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:12:26,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:12:26,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:12:26,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:12:26,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:12:26,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:12:26,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:12:26,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:12:26,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:12:26,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:12:26,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:12:26,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:12:26,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:12:26,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:12:26,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:12:26,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:12:26,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:12:26,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:12:26,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:12:26,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:12:26,854 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:12:26,855 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:12:26,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-skips-unsafe.bpl [2019-08-05 11:12:26,856 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-skips-unsafe.bpl' [2019-08-05 11:12:26,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:12:26,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:12:26,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:26,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:12:26,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:12:26,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:26,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:12:26,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:12:26,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:12:26,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/1) ... [2019-08-05 11:12:26,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:12:26,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:12:26,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:12:26,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:12:26,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (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 11:12:27,019 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:12:27,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:12:27,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:12:27,287 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:12:27,288 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:12:27,289 INFO L202 PluginConnector]: Adding new model loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:27 BoogieIcfgContainer [2019-08-05 11:12:27,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:12:27,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:12:27,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:12:27,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:12:27,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:26" (1/2) ... [2019-08-05 11:12:27,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ce256b and model type loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:12:27, skipping insertion in model container [2019-08-05 11:12:27,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:27" (2/2) ... [2019-08-05 11:12:27,299 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-skips-unsafe.bpl [2019-08-05 11:12:27,308 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:12:27,316 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 11:12:27,328 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 11:12:27,351 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:12:27,351 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:12:27,351 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:12:27,352 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:12:27,352 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:12:27,352 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:12:27,352 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:12:27,352 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:12:27,353 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:12:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-05 11:12:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:27,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:27,378 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:12:27,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 1 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,477 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 11:12:27,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:27,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:12:27,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-08-05 11:12:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-08-05 11:12:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 11:12:27,497 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 2 states. [2019-08-05 11:12:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,507 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:12:27,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-08-05 11:12:27,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-08-05 11:12:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,519 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:12:27,519 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:12:27,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 11:12:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:12:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:12:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:12:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:12:27,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:12:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,568 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:12:27,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-08-05 11:12:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:12:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:27,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:27,569 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 30112, now seen corresponding path program 1 times [2019-08-05 11:12:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,625 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 11:12:27,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:27,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:12:27,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:12:27,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:12:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:27,628 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 3 states. [2019-08-05 11:12:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,712 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:12:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:12:27,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:12:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,714 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:12:27,714 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:12:27,715 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 11:12:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:12:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-08-05 11:12:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:12:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:12:27,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 11:12:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,719 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:12:27,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:12:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:12:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:12:27,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:12:27,721 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash 891384520, now seen corresponding path program 1 times [2019-08-05 11:12:27,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,848 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 11:12:27,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:27,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:12:27,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:12:27,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:12:27,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:27,851 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 11:12:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,941 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:12:27,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:12:27,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:12:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,942 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:12:27,943 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:12:27,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:12:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 11:12:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:12:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:12:27,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-08-05 11:12:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,947 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:12:27,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:12:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:12:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:12:27,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,948 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:12:27,948 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash -552237920, now seen corresponding path program 2 times [2019-08-05 11:12:27,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:28,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:12:28,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:28,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:28,028 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 5 states. [2019-08-05 11:12:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,079 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:12:28,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:28,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:12:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,080 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:12:28,080 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:12:28,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:12:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-08-05 11:12:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:12:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:12:28,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-08-05 11:12:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,084 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:12:28,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:12:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:12:28,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,086 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1] [2019-08-05 11:12:28,086 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2000813112, now seen corresponding path program 3 times [2019-08-05 11:12:28,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:28,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:12:28,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:12:28,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:12:28,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:28,202 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-08-05 11:12:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,341 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:12:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:12:28,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 11:12:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,343 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:12:28,343 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:12:28,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:12:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-08-05 11:12:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:12:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:12:28,347 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-08-05 11:12:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,347 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:12:28,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:12:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:12:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:12:28,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,348 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1] [2019-08-05 11:12:28,348 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash -672967776, now seen corresponding path program 4 times [2019-08-05 11:12:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:28,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:12:28,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:12:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:12:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:28,567 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 7 states. [2019-08-05 11:12:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,630 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:12:28,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:12:28,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-08-05 11:12:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,631 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:12:28,632 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:12:28,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:12:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-08-05 11:12:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:12:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:12:28,635 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-08-05 11:12:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,636 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:12:28,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:12:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:12:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:12:28,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,637 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1] [2019-08-05 11:12:28,637 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash 518640840, now seen corresponding path program 5 times [2019-08-05 11:12:28,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:28,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:12:28,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:12:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:12:28,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:28,791 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 8 states. [2019-08-05 11:12:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,919 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:12:28,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:12:28,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-08-05 11:12:28,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,921 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:12:28,921 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:12:28,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:12:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-08-05 11:12:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:12:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:12:28,926 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-08-05 11:12:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,926 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:12:28,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:12:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:12:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:12:28,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,927 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1] [2019-08-05 11:12:28,928 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1826218656, now seen corresponding path program 6 times [2019-08-05 11:12:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:12:29,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:12:29,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:12:29,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:29,061 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2019-08-05 11:12:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,139 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:12:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:12:29,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-08-05 11:12:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,141 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:12:29,141 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:12:29,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:12:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-08-05 11:12:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:12:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:12:29,146 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-08-05 11:12:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,146 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:12:29,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:12:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:12:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:12:29,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,147 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1] [2019-08-05 11:12:29,147 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash 523560392, now seen corresponding path program 7 times [2019-08-05 11:12:29,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:12:29,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:12:29,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:12:29,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:29,580 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-08-05 11:12:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,622 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:12:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:12:29,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-08-05 11:12:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,625 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:12:29,625 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:12:29,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:12:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-08-05 11:12:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:12:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:12:29,629 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-08-05 11:12:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,629 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:12:29,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:12:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:12:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:12:29,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,631 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1] [2019-08-05 11:12:29,631 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1939263072, now seen corresponding path program 8 times [2019-08-05 11:12:29,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:12:29,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:12:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:12:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:29,827 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2019-08-05 11:12:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,940 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:12:29,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:12:29,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 11:12:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,941 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:12:29,941 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:12:29,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:12:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-08-05 11:12:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:12:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:12:29,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-08-05 11:12:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,947 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:12:29,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:12:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:12:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:12:29,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,948 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1] [2019-08-05 11:12:29,949 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash -986761528, now seen corresponding path program 9 times [2019-08-05 11:12:29,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:12:30,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:30,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:30,198 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 12 states. [2019-08-05 11:12:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,298 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:12:30,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:12:30,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-08-05 11:12:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,299 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:12:30,300 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:12:30,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:12:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-08-05 11:12:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:12:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:12:30,304 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-08-05 11:12:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,305 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:12:30,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:12:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:12:30,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,306 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1] [2019-08-05 11:12:30,306 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1862188896, now seen corresponding path program 10 times [2019-08-05 11:12:30,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:30,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:12:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:12:30,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:12:30,523 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2019-08-05 11:12:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,920 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:12:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:12:30,921 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-08-05 11:12:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,922 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:12:30,922 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:12:30,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:12:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:12:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-08-05 11:12:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:12:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:12:30,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-08-05 11:12:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,927 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:12:30,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:12:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:12:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:12:30,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,928 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1] [2019-08-05 11:12:30,928 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1617479624, now seen corresponding path program 11 times [2019-08-05 11:12:30,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:31,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:12:31,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:31,352 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 14 states. [2019-08-05 11:12:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,428 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:12:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:12:31,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-08-05 11:12:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,430 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:12:31,431 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:12:31,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:12:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-08-05 11:12:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:12:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:12:31,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-08-05 11:12:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,436 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:12:31,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:12:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:12:31,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,437 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1] [2019-08-05 11:12:31,438 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1091702688, now seen corresponding path program 12 times [2019-08-05 11:12:31,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,590 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 11:12:31,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:31,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:12:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:12:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:31,592 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 15 states. [2019-08-05 11:12:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,701 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:12:31,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:12:31,701 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-08-05 11:12:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,702 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:12:31,703 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:12:31,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:12:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-08-05 11:12:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:12:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:12:31,707 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-08-05 11:12:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,708 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:12:31,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:12:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:12:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:12:31,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,709 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1] [2019-08-05 11:12:31,709 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1416730824, now seen corresponding path program 13 times [2019-08-05 11:12:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:31,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:12:31,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:31,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:31,941 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 16 states. [2019-08-05 11:12:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,017 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:12:32,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:32,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2019-08-05 11:12:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,018 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:12:32,019 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:12:32,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:12:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-08-05 11:12:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:12:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:12:32,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-08-05 11:12:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,025 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:12:32,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:12:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:32,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,026 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1] [2019-08-05 11:12:32,027 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash -821322080, now seen corresponding path program 14 times [2019-08-05 11:12:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:32,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:32,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:12:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:12:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:32,218 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2019-08-05 11:12:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,301 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:12:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:12:32,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-08-05 11:12:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,302 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:12:32,302 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:12:32,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:12:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-08-05 11:12:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:12:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:12:32,307 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-08-05 11:12:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,307 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:12:32,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:12:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:12:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:12:32,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,308 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1] [2019-08-05 11:12:32,309 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash 416917960, now seen corresponding path program 15 times [2019-08-05 11:12:32,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:32,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:12:32,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:32,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:32,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:32,696 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 18 states. [2019-08-05 11:12:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,753 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:12:32,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:32,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-08-05 11:12:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,753 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:12:32,753 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:12:32,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:12:32,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-08-05 11:12:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:12:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:12:32,757 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-08-05 11:12:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,758 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:12:32,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:12:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:12:32,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,759 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1] [2019-08-05 11:12:32,759 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash -648155744, now seen corresponding path program 16 times [2019-08-05 11:12:32,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:33,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:33,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:33,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:33,334 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 19 states. [2019-08-05 11:12:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,415 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:12:33,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:33,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-08-05 11:12:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,416 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:12:33,416 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:12:33,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:12:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-08-05 11:12:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:12:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:12:33,421 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-08-05 11:12:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,421 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:12:33,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:12:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:12:33,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,423 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1] [2019-08-05 11:12:33,423 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,424 INFO L82 PathProgramCache]: Analyzing trace with hash 959511240, now seen corresponding path program 17 times [2019-08-05 11:12:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:33,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:33,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:33,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:33,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:33,933 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 20 states. [2019-08-05 11:12:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,015 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:12:34,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:34,016 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-08-05 11:12:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,017 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:12:34,017 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:12:34,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:12:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-08-05 11:12:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:12:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:12:34,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-08-05 11:12:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,023 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:12:34,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:12:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:12:34,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,025 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1] [2019-08-05 11:12:34,025 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1786313888, now seen corresponding path program 18 times [2019-08-05 11:12:34,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:34,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:34,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:34,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,261 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 21 states. [2019-08-05 11:12:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,516 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:12:34,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:34,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-08-05 11:12:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,517 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:12:34,517 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:12:34,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:12:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-08-05 11:12:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:12:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:12:34,520 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-08-05 11:12:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,521 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:12:34,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:12:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:12:34,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,522 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1] [2019-08-05 11:12:34,522 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1426557896, now seen corresponding path program 19 times [2019-08-05 11:12:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:34,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:34,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:12:34,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:12:34,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:12:34,848 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 22 states. [2019-08-05 11:12:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,927 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:12:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:12:34,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-08-05 11:12:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,929 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:12:34,929 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:12:34,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:12:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:12:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-08-05 11:12:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:12:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:12:34,933 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-08-05 11:12:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,933 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:12:34,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:12:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:12:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:12:34,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,934 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1] [2019-08-05 11:12:34,935 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash -120796256, now seen corresponding path program 20 times [2019-08-05 11:12:34,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:35,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:12:35,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:12:35,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:12:35,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:35,415 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 23 states. [2019-08-05 11:12:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,483 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:12:35,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:12:35,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2019-08-05 11:12:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,486 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:12:35,487 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:12:35,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:12:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-08-05 11:12:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:12:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:12:35,490 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-08-05 11:12:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,491 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:12:35,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:12:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:12:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:12:35,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,492 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1] [2019-08-05 11:12:35,492 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash 535649480, now seen corresponding path program 21 times [2019-08-05 11:12:35,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:35,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:12:35,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:12:35,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:12:35,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:35,815 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 24 states. [2019-08-05 11:12:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,906 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:12:35,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:12:35,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2019-08-05 11:12:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,907 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:12:35,908 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:12:35,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:12:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-08-05 11:12:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:12:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:12:35,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-08-05 11:12:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,911 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:12:35,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:12:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:12:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:35,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,912 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1] [2019-08-05 11:12:35,912 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1724471968, now seen corresponding path program 22 times [2019-08-05 11:12:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:12:36,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:12:36,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:12:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:36,289 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 25 states. [2019-08-05 11:12:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,364 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:12:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:12:36,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2019-08-05 11:12:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,371 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:12:36,371 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:12:36,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:12:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-08-05 11:12:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:12:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:12:36,377 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-08-05 11:12:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,378 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:12:36,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:12:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:12:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:12:36,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,379 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1] [2019-08-05 11:12:36,380 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1634889160, now seen corresponding path program 23 times [2019-08-05 11:12:36,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:12:36,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:12:36,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:12:36,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:36,676 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 26 states. [2019-08-05 11:12:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,745 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:12:36,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:12:36,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-08-05 11:12:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,747 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:12:36,747 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:12:36,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:12:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-08-05 11:12:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:12:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:12:36,751 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-08-05 11:12:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,751 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:12:36,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:12:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:12:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:12:36,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,752 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1] [2019-08-05 11:12:36,752 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash 48146848, now seen corresponding path program 24 times [2019-08-05 11:12:36,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:37,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:12:37,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:37,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:37,731 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 27 states. [2019-08-05 11:12:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,828 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:12:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:37,828 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 75 [2019-08-05 11:12:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,829 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:12:37,829 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:12:37,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:12:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-08-05 11:12:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:12:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:12:37,833 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-08-05 11:12:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,844 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:12:37,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:12:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:12:37,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,845 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1] [2019-08-05 11:12:37,846 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash -182010168, now seen corresponding path program 25 times [2019-08-05 11:12:37,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:38,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:38,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:38,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:38,394 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 28 states. [2019-08-05 11:12:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,468 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:12:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:38,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 78 [2019-08-05 11:12:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,470 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:12:38,470 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:12:38,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:12:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-08-05 11:12:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:12:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:12:38,473 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-08-05 11:12:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,473 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:12:38,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:12:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:12:38,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,474 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1] [2019-08-05 11:12:38,474 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2021869408, now seen corresponding path program 26 times [2019-08-05 11:12:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:39,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:39,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:39,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:39,353 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 29 states. [2019-08-05 11:12:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,432 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:12:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:39,433 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2019-08-05 11:12:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,434 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:12:39,434 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:12:39,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:12:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-08-05 11:12:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:12:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:12:39,437 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-08-05 11:12:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,437 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:12:39,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:12:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:12:39,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,438 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1] [2019-08-05 11:12:39,439 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash -895856696, now seen corresponding path program 27 times [2019-08-05 11:12:39,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:40,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:40,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:12:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:12:40,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:40,353 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 30 states. [2019-08-05 11:12:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,454 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:12:40,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:12:40,459 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2019-08-05 11:12:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,460 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:12:40,460 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:12:40,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:12:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-08-05 11:12:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:12:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:12:40,463 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-08-05 11:12:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,464 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:12:40,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:12:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:12:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:12:40,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,465 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1] [2019-08-05 11:12:40,465 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash 454264736, now seen corresponding path program 28 times [2019-08-05 11:12:40,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:40,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:12:40,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:12:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:12:40,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:40,934 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 31 states. [2019-08-05 11:12:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,018 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:12:41,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:41,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 87 [2019-08-05 11:12:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,020 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:12:41,020 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:12:41,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:12:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-08-05 11:12:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:12:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:12:41,024 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-08-05 11:12:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,024 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:12:41,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:12:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:12:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:12:41,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,025 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1] [2019-08-05 11:12:41,025 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash -446881592, now seen corresponding path program 29 times [2019-08-05 11:12:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:41,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:12:41,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:12:41,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:12:41,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:12:41,505 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 32 states. [2019-08-05 11:12:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,786 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:12:41,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:12:41,786 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 90 [2019-08-05 11:12:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,787 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:12:41,787 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:12:41,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:12:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:12:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-08-05 11:12:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:12:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:12:41,792 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-08-05 11:12:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,792 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:12:41,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:12:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:12:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:41,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,793 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1] [2019-08-05 11:12:41,793 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1343428256, now seen corresponding path program 30 times [2019-08-05 11:12:41,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:42,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:12:42,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:12:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:12:42,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:12:42,216 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 33 states. [2019-08-05 11:12:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,353 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:12:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:12:42,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2019-08-05 11:12:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,355 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:12:42,355 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:12:42,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:12:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:12:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-08-05 11:12:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:12:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:12:42,358 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-08-05 11:12:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,358 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:12:42,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:12:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:12:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:12:42,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,359 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1] [2019-08-05 11:12:42,360 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1560228296, now seen corresponding path program 31 times [2019-08-05 11:12:42,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:42,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:12:42,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:12:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:12:42,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:12:42,841 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 34 states. [2019-08-05 11:12:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,931 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:12:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:12:42,932 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 96 [2019-08-05 11:12:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,933 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:12:42,933 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:12:42,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:12:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:12:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-08-05 11:12:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:12:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:12:42,938 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-08-05 11:12:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,938 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:12:42,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:12:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:12:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:12:42,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,939 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1] [2019-08-05 11:12:42,939 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 619406752, now seen corresponding path program 32 times [2019-08-05 11:12:42,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:12:43,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:12:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:12:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:43,370 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 35 states. [2019-08-05 11:12:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,462 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:12:43,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:12:43,463 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2019-08-05 11:12:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,464 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:12:43,464 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:12:43,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:12:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-08-05 11:12:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:12:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:12:43,469 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-08-05 11:12:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,469 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:12:43,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:12:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:12:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:12:43,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,470 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1] [2019-08-05 11:12:43,470 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1561363144, now seen corresponding path program 33 times [2019-08-05 11:12:43,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:43,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:12:43,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:12:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:12:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:12:43,960 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 36 states. [2019-08-05 11:12:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,055 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:12:44,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:12:44,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2019-08-05 11:12:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,057 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:12:44,057 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:12:44,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:12:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:12:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-08-05 11:12:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:12:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:12:44,060 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-08-05 11:12:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,061 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:12:44,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:12:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:12:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:12:44,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,062 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1] [2019-08-05 11:12:44,062 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash 67925152, now seen corresponding path program 34 times [2019-08-05 11:12:44,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:44,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:12:44,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:12:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:12:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:12:44,684 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 37 states. [2019-08-05 11:12:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,822 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:12:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:12:44,822 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 105 [2019-08-05 11:12:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,824 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:12:44,824 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:12:44,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:12:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:12:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-08-05 11:12:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:12:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:12:44,828 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-08-05 11:12:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,828 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:12:44,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:12:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:12:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:12:44,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,829 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1] [2019-08-05 11:12:44,829 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 622924744, now seen corresponding path program 35 times [2019-08-05 11:12:44,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:45,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:12:45,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:12:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:12:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:45,724 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 38 states. [2019-08-05 11:12:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,823 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:12:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:12:45,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 108 [2019-08-05 11:12:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,825 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:12:45,825 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:12:45,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:12:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-08-05 11:12:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:12:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:12:45,829 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-08-05 11:12:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,830 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:12:45,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:12:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:12:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:12:45,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,831 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1] [2019-08-05 11:12:45,831 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1008319584, now seen corresponding path program 36 times [2019-08-05 11:12:45,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:46,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:12:46,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:12:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:12:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:46,778 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 39 states. [2019-08-05 11:12:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,895 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:12:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:12:46,896 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 111 [2019-08-05 11:12:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,897 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:12:46,897 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:12:46,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:12:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-08-05 11:12:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:12:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:12:46,902 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-08-05 11:12:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,902 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:12:46,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:12:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:12:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:12:46,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,903 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1] [2019-08-05 11:12:46,903 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash 146859208, now seen corresponding path program 37 times [2019-08-05 11:12:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:48,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:12:48,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:12:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:12:48,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:48,274 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 40 states. [2019-08-05 11:12:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,376 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:12:48,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:12:48,377 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2019-08-05 11:12:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,378 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:12:48,378 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:12:48,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:12:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-08-05 11:12:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:12:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:12:48,382 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-08-05 11:12:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,382 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:12:48,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:12:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:12:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:12:48,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,383 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1] [2019-08-05 11:12:48,384 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1494691168, now seen corresponding path program 38 times [2019-08-05 11:12:48,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:49,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:12:49,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:12:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:12:49,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:49,177 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 41 states. [2019-08-05 11:12:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,282 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:12:49,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:12:49,283 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 117 [2019-08-05 11:12:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,284 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:12:49,284 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:12:49,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:12:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-08-05 11:12:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:12:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 11:12:49,288 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-08-05 11:12:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,289 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 11:12:49,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:12:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 11:12:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:12:49,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,290 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1] [2019-08-05 11:12:49,290 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1870656968, now seen corresponding path program 39 times [2019-08-05 11:12:49,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:49,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:12:49,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:12:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:12:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:49,959 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 42 states. [2019-08-05 11:12:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,089 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 11:12:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:12:50,090 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 120 [2019-08-05 11:12:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,091 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:12:50,091 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:12:50,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:12:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-08-05 11:12:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:12:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:12:50,096 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-08-05 11:12:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,096 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:12:50,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:12:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:12:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:12:50,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,097 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1] [2019-08-05 11:12:50,097 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1535386016, now seen corresponding path program 40 times [2019-08-05 11:12:50,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:51,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:12:51,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:12:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:12:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:51,164 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 43 states. [2019-08-05 11:12:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,277 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 11:12:51,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:12:51,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2019-08-05 11:12:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,279 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:12:51,279 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:12:51,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:12:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-08-05 11:12:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:12:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 11:12:51,283 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-08-05 11:12:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,284 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 11:12:51,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:12:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 11:12:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 11:12:51,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,285 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1] [2019-08-05 11:12:51,285 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash -722581816, now seen corresponding path program 41 times [2019-08-05 11:12:51,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:52,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:12:52,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:12:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:12:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:52,304 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 44 states. [2019-08-05 11:12:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,041 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 11:12:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:12:53,041 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 126 [2019-08-05 11:12:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,042 INFO L225 Difference]: With dead ends: 132 [2019-08-05 11:12:53,042 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 11:12:53,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 11:12:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-08-05 11:12:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:12:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 11:12:53,046 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-08-05 11:12:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,047 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 11:12:53,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:12:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 11:12:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:12:53,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,048 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1] [2019-08-05 11:12:53,048 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash -64474976, now seen corresponding path program 42 times [2019-08-05 11:12:53,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:53,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:12:53,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:12:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:12:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:53,940 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 45 states. [2019-08-05 11:12:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,102 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 11:12:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:12:54,102 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2019-08-05 11:12:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,103 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:12:54,104 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:12:54,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:12:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-08-05 11:12:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:12:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 11:12:54,108 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-08-05 11:12:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,108 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 11:12:54,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:12:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 11:12:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 11:12:54,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,109 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1] [2019-08-05 11:12:54,109 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash -929310776, now seen corresponding path program 43 times [2019-08-05 11:12:54,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:55,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:12:55,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:12:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:12:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:55,290 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 46 states. [2019-08-05 11:12:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,436 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-05 11:12:55,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:12:55,437 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 132 [2019-08-05 11:12:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,437 INFO L225 Difference]: With dead ends: 138 [2019-08-05 11:12:55,438 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 11:12:55,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 11:12:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-08-05 11:12:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:12:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 11:12:55,440 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-08-05 11:12:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,441 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 11:12:55,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:12:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 11:12:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:12:55,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,442 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1] [2019-08-05 11:12:55,442 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash 256180128, now seen corresponding path program 44 times [2019-08-05 11:12:55,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:56,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:12:56,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:12:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:12:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:56,441 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 47 states. [2019-08-05 11:12:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,792 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 11:12:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:12:56,792 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 135 [2019-08-05 11:12:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,793 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:12:56,794 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:12:56,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:12:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-08-05 11:12:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 11:12:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-08-05 11:12:56,797 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-08-05 11:12:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,797 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-08-05 11:12:56,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:12:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-08-05 11:12:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 11:12:56,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,798 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1] [2019-08-05 11:12:56,798 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash -300373816, now seen corresponding path program 45 times [2019-08-05 11:12:56,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:57,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:12:57,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:12:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:12:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:12:57,654 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 48 states. [2019-08-05 11:12:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,867 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-08-05 11:12:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:12:57,868 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 138 [2019-08-05 11:12:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,869 INFO L225 Difference]: With dead ends: 144 [2019-08-05 11:12:57,869 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 11:12:57,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:12:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 11:12:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-08-05 11:12:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:12:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 11:12:57,873 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-08-05 11:12:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,873 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 11:12:57,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:12:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 11:12:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:12:57,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,874 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1] [2019-08-05 11:12:57,875 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2025156960, now seen corresponding path program 46 times [2019-08-05 11:12:57,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:12:58,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:12:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:12:58,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:12:58,938 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 49 states. [2019-08-05 11:12:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,078 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 11:12:59,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:12:59,078 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 141 [2019-08-05 11:12:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,079 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:12:59,079 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:12:59,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:12:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:12:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-08-05 11:12:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:12:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-08-05 11:12:59,084 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-08-05 11:12:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,084 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-08-05 11:12:59,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:12:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-08-05 11:12:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 11:12:59,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,085 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1] [2019-08-05 11:12:59,085 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash -51070520, now seen corresponding path program 47 times [2019-08-05 11:12:59,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:00,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:13:00,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:13:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:13:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:13:00,020 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 50 states. [2019-08-05 11:13:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,159 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-05 11:13:00,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:13:00,160 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 144 [2019-08-05 11:13:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,161 INFO L225 Difference]: With dead ends: 150 [2019-08-05 11:13:00,161 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 11:13:00,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:13:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 11:13:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-08-05 11:13:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:13:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 11:13:00,164 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-08-05 11:13:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,165 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 11:13:00,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:13:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 11:13:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:13:00,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,166 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1] [2019-08-05 11:13:00,166 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1029120608, now seen corresponding path program 48 times [2019-08-05 11:13:00,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:01,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:13:01,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:13:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:13:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:13:01,451 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 51 states. [2019-08-05 11:13:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,624 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 11:13:01,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:13:01,624 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 147 [2019-08-05 11:13:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,625 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:01,625 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:01,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:13:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:01,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-08-05 11:13:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 11:13:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-08-05 11:13:01,629 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-08-05 11:13:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,629 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-08-05 11:13:01,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:13:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-08-05 11:13:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 11:13:01,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,631 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1] [2019-08-05 11:13:01,631 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1061156152, now seen corresponding path program 49 times [2019-08-05 11:13:01,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:02,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:13:02,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:13:02,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:13:02,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:13:02,637 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 52 states. [2019-08-05 11:13:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,792 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-08-05 11:13:02,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:13:02,792 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 150 [2019-08-05 11:13:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,794 INFO L225 Difference]: With dead ends: 156 [2019-08-05 11:13:02,794 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 11:13:02,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:13:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 11:13:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-08-05 11:13:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:13:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 11:13:02,797 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-08-05 11:13:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,798 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 11:13:02,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:13:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 11:13:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:13:02,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,799 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1] [2019-08-05 11:13:02,799 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1949307744, now seen corresponding path program 50 times [2019-08-05 11:13:02,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:03,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:13:03,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:13:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:13:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:13:03,820 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 53 states. [2019-08-05 11:13:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,956 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 11:13:03,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:13:03,957 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 153 [2019-08-05 11:13:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,958 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:13:03,958 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:13:03,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:13:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:13:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-08-05 11:13:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:13:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-08-05 11:13:03,961 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-08-05 11:13:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,962 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-08-05 11:13:03,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:13:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-08-05 11:13:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 11:13:03,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,963 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1] [2019-08-05 11:13:03,963 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash 420125640, now seen corresponding path program 51 times [2019-08-05 11:13:03,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:05,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:13:05,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:13:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:13:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:13:05,377 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 54 states. [2019-08-05 11:13:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,547 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-05 11:13:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:13:05,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 156 [2019-08-05 11:13:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,549 INFO L225 Difference]: With dead ends: 162 [2019-08-05 11:13:05,549 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 11:13:05,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:13:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 11:13:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-08-05 11:13:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:13:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 11:13:05,552 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-08-05 11:13:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,553 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 11:13:05,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:13:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 11:13:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:13:05,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,554 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1] [2019-08-05 11:13:05,554 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 422558624, now seen corresponding path program 52 times [2019-08-05 11:13:05,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:06,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:13:06,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:13:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:13:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:13:06,914 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 55 states. [2019-08-05 11:13:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,061 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-05 11:13:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:13:07,061 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 159 [2019-08-05 11:13:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,062 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:13:07,063 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:13:07,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:13:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:13:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-08-05 11:13:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 11:13:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-08-05 11:13:07,067 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-08-05 11:13:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,067 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-08-05 11:13:07,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:13:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-08-05 11:13:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 11:13:07,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,068 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1] [2019-08-05 11:13:07,068 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash -110859064, now seen corresponding path program 53 times [2019-08-05 11:13:07,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:09,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:13:09,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:13:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:13:09,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:13:09,778 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 56 states. [2019-08-05 11:13:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,921 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-08-05 11:13:09,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:13:09,922 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 162 [2019-08-05 11:13:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,923 INFO L225 Difference]: With dead ends: 168 [2019-08-05 11:13:09,923 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 11:13:09,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:13:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 11:13:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-08-05 11:13:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:13:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 11:13:09,927 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-08-05 11:13:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,928 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 11:13:09,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:13:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 11:13:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:13:09,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,929 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1] [2019-08-05 11:13:09,929 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 221792928, now seen corresponding path program 54 times [2019-08-05 11:13:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:11,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:13:11,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:13:11,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:13:11,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:13:11,411 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 57 states. [2019-08-05 11:13:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,582 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-05 11:13:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:13:11,583 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 165 [2019-08-05 11:13:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:11,584 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:13:11,584 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:13:11,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:13:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:13:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-08-05 11:13:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:13:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-08-05 11:13:11,586 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-08-05 11:13:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:11,586 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-08-05 11:13:11,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:13:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-08-05 11:13:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 11:13:11,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:11,587 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1] [2019-08-05 11:13:11,587 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1767734728, now seen corresponding path program 55 times [2019-08-05 11:13:11,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:11,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:13:11,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:12,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:13:12,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:13:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:13:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:13:12,743 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 58 states. [2019-08-05 11:13:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,919 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-05 11:13:12,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:13:12,920 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 168 [2019-08-05 11:13:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,921 INFO L225 Difference]: With dead ends: 174 [2019-08-05 11:13:12,921 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 11:13:12,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:13:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 11:13:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-08-05 11:13:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:13:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 11:13:12,925 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-08-05 11:13:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,925 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 11:13:12,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:13:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 11:13:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:13:12,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,926 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1] [2019-08-05 11:13:12,927 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1985583520, now seen corresponding path program 56 times [2019-08-05 11:13:12,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:14,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:13:14,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:13:14,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:13:14,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:13:14,102 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 59 states. [2019-08-05 11:13:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,277 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-05 11:13:14,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:13:14,278 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 171 [2019-08-05 11:13:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,279 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:13:14,279 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:13:14,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:13:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:13:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-08-05 11:13:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 11:13:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-08-05 11:13:14,282 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-08-05 11:13:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,283 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-08-05 11:13:14,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:13:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-08-05 11:13:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 11:13:14,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,284 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1] [2019-08-05 11:13:14,284 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2071605560, now seen corresponding path program 57 times [2019-08-05 11:13:14,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:15,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:13:15,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:13:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:13:15,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:13:15,844 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 60 states. [2019-08-05 11:13:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,081 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-08-05 11:13:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:13:16,081 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 174 [2019-08-05 11:13:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,082 INFO L225 Difference]: With dead ends: 180 [2019-08-05 11:13:16,082 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 11:13:16,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:13:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 11:13:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-08-05 11:13:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:13:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 11:13:16,085 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-08-05 11:13:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,086 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 11:13:16,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:13:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 11:13:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:13:16,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,087 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1] [2019-08-05 11:13:16,087 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,087 INFO L82 PathProgramCache]: Analyzing trace with hash -821843808, now seen corresponding path program 58 times [2019-08-05 11:13:16,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:13:17,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:13:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:13:17,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:13:17,502 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 61 states. [2019-08-05 11:13:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,762 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-08-05 11:13:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:13:17,763 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 177 [2019-08-05 11:13:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,764 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:13:17,764 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:13:17,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:13:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:13:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-08-05 11:13:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-05 11:13:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-08-05 11:13:17,768 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-08-05 11:13:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,769 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-08-05 11:13:17,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:13:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-08-05 11:13:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 11:13:17,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,770 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1] [2019-08-05 11:13:17,770 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2053988296, now seen corresponding path program 59 times [2019-08-05 11:13:17,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:19,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:13:19,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:13:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:13:19,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:13:19,167 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 62 states. [2019-08-05 11:13:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,464 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-08-05 11:13:19,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:13:19,465 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 180 [2019-08-05 11:13:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,466 INFO L225 Difference]: With dead ends: 186 [2019-08-05 11:13:19,467 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:13:19,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:13:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:13:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-08-05 11:13:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:13:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 11:13:19,470 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-08-05 11:13:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,470 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 11:13:19,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:13:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 11:13:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:13:19,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,471 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1] [2019-08-05 11:13:19,472 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash -39422048, now seen corresponding path program 60 times [2019-08-05 11:13:19,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:20,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:20,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:13:20,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:13:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:13:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:13:20,879 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 63 states. [2019-08-05 11:13:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:21,135 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-08-05 11:13:21,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:13:21,135 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 183 [2019-08-05 11:13:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:21,136 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:13:21,136 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:13:21,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:13:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:13:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2019-08-05 11:13:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 11:13:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-08-05 11:13:21,138 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-08-05 11:13:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:21,138 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-08-05 11:13:21,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:13:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-08-05 11:13:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-05 11:13:21,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:21,139 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1] [2019-08-05 11:13:21,139 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1901842232, now seen corresponding path program 61 times [2019-08-05 11:13:21,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:21,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:13:21,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:22,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:22,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:13:22,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:13:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:13:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:13:22,820 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 64 states. [2019-08-05 11:13:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:23,011 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-08-05 11:13:23,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:13:23,011 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 186 [2019-08-05 11:13:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:23,013 INFO L225 Difference]: With dead ends: 192 [2019-08-05 11:13:23,013 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 11:13:23,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:13:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 11:13:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-08-05 11:13:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:13:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 11:13:23,016 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-08-05 11:13:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:23,017 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 11:13:23,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:13:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 11:13:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:13:23,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:23,018 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1] [2019-08-05 11:13:23,018 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:23,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1420953248, now seen corresponding path program 62 times [2019-08-05 11:13:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:23,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:13:23,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:24,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:24,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:13:24,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:13:24,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:13:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:13:24,469 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 65 states. [2019-08-05 11:13:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:24,691 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-08-05 11:13:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:13:24,691 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 189 [2019-08-05 11:13:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:24,693 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:13:24,693 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:13:24,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:13:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:13:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-08-05 11:13:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 11:13:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-08-05 11:13:24,696 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-08-05 11:13:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:24,697 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-08-05 11:13:24,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:13:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-08-05 11:13:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 11:13:24,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:24,698 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1] [2019-08-05 11:13:24,699 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 414859720, now seen corresponding path program 63 times [2019-08-05 11:13:24,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:24,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:13:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:26,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:26,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:13:26,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:13:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:13:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:13:26,599 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 66 states. [2019-08-05 11:13:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:26,779 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-08-05 11:13:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:13:26,779 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 192 [2019-08-05 11:13:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:26,781 INFO L225 Difference]: With dead ends: 198 [2019-08-05 11:13:26,781 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 11:13:26,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:13:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 11:13:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-08-05 11:13:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:13:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 11:13:26,785 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-08-05 11:13:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:26,786 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 11:13:26,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:13:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 11:13:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:13:26,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:26,787 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1] [2019-08-05 11:13:26,787 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:26,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1835641440, now seen corresponding path program 64 times [2019-08-05 11:13:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:26,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:13:26,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:29,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:29,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:13:29,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:13:29,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:13:29,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:13:29,141 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 67 states. [2019-08-05 11:13:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:29,360 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-08-05 11:13:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:13:29,360 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 195 [2019-08-05 11:13:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:29,361 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:13:29,362 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:13:29,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:13:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:13:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-08-05 11:13:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 11:13:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-08-05 11:13:29,365 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-08-05 11:13:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:29,366 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-08-05 11:13:29,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:13:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-08-05 11:13:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-08-05 11:13:29,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:29,367 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1] [2019-08-05 11:13:29,367 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2076208440, now seen corresponding path program 65 times [2019-08-05 11:13:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:29,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:13:29,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:31,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:31,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:13:31,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:13:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:13:31,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:13:31,240 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 68 states. [2019-08-05 11:13:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:32,070 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-08-05 11:13:32,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:13:32,071 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 198 [2019-08-05 11:13:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:32,072 INFO L225 Difference]: With dead ends: 204 [2019-08-05 11:13:32,072 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 11:13:32,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:13:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 11:13:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2019-08-05 11:13:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:13:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 11:13:32,077 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-08-05 11:13:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:32,078 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 11:13:32,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:13:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 11:13:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:13:32,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:32,080 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1] [2019-08-05 11:13:32,081 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash -507288416, now seen corresponding path program 66 times [2019-08-05 11:13:32,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:32,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:13:32,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:34,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:34,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:13:34,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:13:34,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:13:34,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:13:34,254 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 69 states. [2019-08-05 11:13:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:34,526 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-08-05 11:13:34,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:13:34,527 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 201 [2019-08-05 11:13:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:34,528 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:13:34,528 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:13:34,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:13:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:13:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-08-05 11:13:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 11:13:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-08-05 11:13:34,531 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-08-05 11:13:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:34,531 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-08-05 11:13:34,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:13:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-08-05 11:13:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 11:13:34,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:34,533 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1] [2019-08-05 11:13:34,533 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1355031496, now seen corresponding path program 67 times [2019-08-05 11:13:34,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:34,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:13:34,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:36,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:36,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:13:36,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:13:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:13:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:13:36,316 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 70 states. [2019-08-05 11:13:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:36,605 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-08-05 11:13:36,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:13:36,605 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 204 [2019-08-05 11:13:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:36,606 INFO L225 Difference]: With dead ends: 210 [2019-08-05 11:13:36,606 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 11:13:36,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:13:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 11:13:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-08-05 11:13:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:13:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 11:13:36,609 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-08-05 11:13:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:36,610 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 11:13:36,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:13:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 11:13:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:13:36,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:36,611 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1] [2019-08-05 11:13:36,611 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash -659999840, now seen corresponding path program 68 times [2019-08-05 11:13:36,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:36,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:13:36,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:38,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:38,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:13:38,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:13:38,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:13:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:13:38,393 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 71 states. [2019-08-05 11:13:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:38,611 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-08-05 11:13:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:13:38,611 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 207 [2019-08-05 11:13:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:38,613 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:38,613 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:13:38,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:13:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:13:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-08-05 11:13:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-08-05 11:13:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-08-05 11:13:38,617 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-08-05 11:13:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:38,618 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-08-05 11:13:38,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:13:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-08-05 11:13:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-08-05 11:13:38,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:38,619 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1] [2019-08-05 11:13:38,619 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 299365576, now seen corresponding path program 69 times [2019-08-05 11:13:38,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:38,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:13:38,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:40,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:40,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:13:40,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:13:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:13:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:13:40,595 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 72 states. [2019-08-05 11:13:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:40,823 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-08-05 11:13:40,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:13:40,823 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 210 [2019-08-05 11:13:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:40,825 INFO L225 Difference]: With dead ends: 216 [2019-08-05 11:13:40,825 INFO L226 Difference]: Without dead ends: 216 [2019-08-05 11:13:40,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:13:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-08-05 11:13:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-08-05 11:13:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:13:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 11:13:40,829 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-08-05 11:13:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:40,830 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 11:13:40,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:13:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 11:13:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:13:40,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:40,831 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1] [2019-08-05 11:13:40,832 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2042086048, now seen corresponding path program 70 times [2019-08-05 11:13:40,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:40,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:13:40,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:43,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:43,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:13:43,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:13:43,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:13:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:43,651 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 73 states. [2019-08-05 11:13:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:43,898 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-08-05 11:13:43,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:13:43,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 213 [2019-08-05 11:13:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:43,900 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:13:43,900 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:13:43,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:13:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-08-05 11:13:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-05 11:13:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-08-05 11:13:43,904 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-08-05 11:13:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:43,904 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-08-05 11:13:43,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:13:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-08-05 11:13:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-08-05 11:13:43,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:43,905 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1] [2019-08-05 11:13:43,905 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993352, now seen corresponding path program 71 times [2019-08-05 11:13:43,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:43,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:13:43,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:13:45,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:13:45,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:13:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:45,794 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 74 states. [2019-08-05 11:13:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:46,023 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-08-05 11:13:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:13:46,024 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 216 [2019-08-05 11:13:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:46,025 INFO L225 Difference]: With dead ends: 222 [2019-08-05 11:13:46,025 INFO L226 Difference]: Without dead ends: 222 [2019-08-05 11:13:46,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-05 11:13:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-08-05 11:13:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 11:13:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-08-05 11:13:46,029 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-08-05 11:13:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:46,029 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-08-05 11:13:46,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:13:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-08-05 11:13:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 11:13:46,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:46,030 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1] [2019-08-05 11:13:46,030 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash 861868448, now seen corresponding path program 72 times [2019-08-05 11:13:46,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:46,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:13:46,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:48,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:48,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:13:48,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:13:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:13:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:48,768 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 75 states. [2019-08-05 11:13:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:49,003 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-08-05 11:13:49,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:13:49,003 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 219 [2019-08-05 11:13:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:49,005 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:13:49,005 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:13:49,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:13:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-08-05 11:13:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 11:13:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-08-05 11:13:49,008 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-08-05 11:13:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:49,009 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-08-05 11:13:49,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:13:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-08-05 11:13:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-08-05 11:13:49,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:49,010 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1] [2019-08-05 11:13:49,010 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 602756808, now seen corresponding path program 73 times [2019-08-05 11:13:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:49,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:13:49,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:13:51,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:13:51,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:13:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:51,048 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 76 states. [2019-08-05 11:13:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:51,298 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-08-05 11:13:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:13:51,299 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 222 [2019-08-05 11:13:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:51,300 INFO L225 Difference]: With dead ends: 228 [2019-08-05 11:13:51,300 INFO L226 Difference]: Without dead ends: 228 [2019-08-05 11:13:51,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-08-05 11:13:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2019-08-05 11:13:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 11:13:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-08-05 11:13:51,303 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-08-05 11:13:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:51,303 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-08-05 11:13:51,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:13:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-08-05 11:13:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 11:13:51,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:51,305 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1] [2019-08-05 11:13:51,305 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash -535879520, now seen corresponding path program 74 times [2019-08-05 11:13:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:51,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:13:51,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:54,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:13:54,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:13:54,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:13:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:13:54,510 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 77 states. [2019-08-05 11:13:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:54,753 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-08-05 11:13:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:13:54,754 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 225 [2019-08-05 11:13:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:54,755 INFO L225 Difference]: With dead ends: 231 [2019-08-05 11:13:54,755 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 11:13:54,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:13:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 11:13:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-08-05 11:13:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-05 11:13:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-08-05 11:13:54,760 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-08-05 11:13:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:54,760 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-08-05 11:13:54,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:13:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-08-05 11:13:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-08-05 11:13:54,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:54,762 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1] [2019-08-05 11:13:54,762 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 976840, now seen corresponding path program 75 times [2019-08-05 11:13:54,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:54,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:13:54,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:57,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:13:57,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:13:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:13:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:13:57,015 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 78 states. [2019-08-05 11:13:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:57,319 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-08-05 11:13:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:13:57,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 228 [2019-08-05 11:13:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:57,321 INFO L225 Difference]: With dead ends: 234 [2019-08-05 11:13:57,322 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 11:13:57,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:13:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 11:13:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-08-05 11:13:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 11:13:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-08-05 11:13:57,328 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-08-05 11:13:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:57,328 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-08-05 11:13:57,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:13:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-08-05 11:13:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 11:13:57,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:57,330 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1] [2019-08-05 11:13:57,330 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash -969412704, now seen corresponding path program 76 times [2019-08-05 11:13:57,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:57,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:13:57,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:13:59,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:13:59,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:13:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:13:59,362 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 79 states. [2019-08-05 11:13:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,602 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-08-05 11:13:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:13:59,602 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 231 [2019-08-05 11:13:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,604 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:13:59,604 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:13:59,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:13:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:13:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2019-08-05 11:13:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-05 11:13:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-08-05 11:13:59,607 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-08-05 11:13:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,608 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-08-05 11:13:59,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:13:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-08-05 11:13:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-05 11:13:59,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,609 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1] [2019-08-05 11:13:59,609 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash -419448632, now seen corresponding path program 77 times [2019-08-05 11:13:59,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:14:01,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:14:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:14:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:14:01,791 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 80 states. [2019-08-05 11:14:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,086 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-08-05 11:14:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:14:02,086 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 234 [2019-08-05 11:14:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,088 INFO L225 Difference]: With dead ends: 240 [2019-08-05 11:14:02,088 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 11:14:02,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:14:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 11:14:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2019-08-05 11:14:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 11:14:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-08-05 11:14:02,091 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-08-05 11:14:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,092 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-08-05 11:14:02,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:14:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-08-05 11:14:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-08-05 11:14:02,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,093 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1] [2019-08-05 11:14:02,093 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1740013920, now seen corresponding path program 78 times [2019-08-05 11:14:02,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:04,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:14:04,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:14:04,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:14:04,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:14:04,443 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 81 states. [2019-08-05 11:14:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,709 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-08-05 11:14:04,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:14:04,709 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 237 [2019-08-05 11:14:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,711 INFO L225 Difference]: With dead ends: 243 [2019-08-05 11:14:04,711 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 11:14:04,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:14:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 11:14:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-08-05 11:14:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-08-05 11:14:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-08-05 11:14:04,715 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-08-05 11:14:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,715 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-08-05 11:14:04,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:14:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-08-05 11:14:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-08-05 11:14:04,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,716 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1] [2019-08-05 11:14:04,717 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash -800077368, now seen corresponding path program 79 times [2019-08-05 11:14:04,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:14:06,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:14:06,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:14:06,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:14:06,950 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 82 states. [2019-08-05 11:14:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,246 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-08-05 11:14:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:14:07,247 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 240 [2019-08-05 11:14:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,248 INFO L225 Difference]: With dead ends: 246 [2019-08-05 11:14:07,248 INFO L226 Difference]: Without dead ends: 246 [2019-08-05 11:14:07,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:14:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-08-05 11:14:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2019-08-05 11:14:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 11:14:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-08-05 11:14:07,252 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-08-05 11:14:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,253 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-08-05 11:14:07,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:14:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-08-05 11:14:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-08-05 11:14:07,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,254 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1] [2019-08-05 11:14:07,254 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1957940640, now seen corresponding path program 80 times [2019-08-05 11:14:07,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:09,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:14:09,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:14:09,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:14:09,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:14:09,672 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 83 states. [2019-08-05 11:14:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,929 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-08-05 11:14:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:14:09,929 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 243 [2019-08-05 11:14:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,931 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:14:09,931 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:14:09,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:14:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:14:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2019-08-05 11:14:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-08-05 11:14:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-08-05 11:14:09,934 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-08-05 11:14:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,934 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-08-05 11:14:09,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:14:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-08-05 11:14:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-08-05 11:14:09,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,935 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1] [2019-08-05 11:14:09,935 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash -946922808, now seen corresponding path program 81 times [2019-08-05 11:14:09,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:12,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:12,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:14:12,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:14:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:14:12,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:14:12,207 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 84 states. [2019-08-05 11:14:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:12,561 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-08-05 11:14:12,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:14:12,573 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 246 [2019-08-05 11:14:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:12,573 INFO L225 Difference]: With dead ends: 252 [2019-08-05 11:14:12,574 INFO L226 Difference]: Without dead ends: 252 [2019-08-05 11:14:12,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:14:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-08-05 11:14:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2019-08-05 11:14:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-08-05 11:14:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-08-05 11:14:12,577 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-08-05 11:14:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:12,577 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-08-05 11:14:12,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:14:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-08-05 11:14:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-08-05 11:14:12,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:12,578 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1] [2019-08-05 11:14:12,578 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash -437855072, now seen corresponding path program 82 times [2019-08-05 11:14:12,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:12,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:14:12,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:15,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:14:15,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:14:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:14:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:14:15,249 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 85 states. [2019-08-05 11:14:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,530 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-08-05 11:14:15,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:14:15,531 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 249 [2019-08-05 11:14:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,532 INFO L225 Difference]: With dead ends: 255 [2019-08-05 11:14:15,532 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 11:14:15,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:14:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 11:14:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-08-05 11:14:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 11:14:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-08-05 11:14:15,534 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-08-05 11:14:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,535 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-08-05 11:14:15,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:14:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-08-05 11:14:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-08-05 11:14:15,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,536 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1] [2019-08-05 11:14:15,536 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,537 INFO L82 PathProgramCache]: Analyzing trace with hash -330454072, now seen corresponding path program 83 times [2019-08-05 11:14:15,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:18,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:18,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:14:18,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:14:18,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:14:18,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:14:18,351 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 86 states. [2019-08-05 11:14:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:18,618 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-08-05 11:14:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:14:18,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 252 [2019-08-05 11:14:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:18,620 INFO L225 Difference]: With dead ends: 258 [2019-08-05 11:14:18,620 INFO L226 Difference]: Without dead ends: 258 [2019-08-05 11:14:18,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:14:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-08-05 11:14:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-08-05 11:14:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 11:14:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-08-05 11:14:18,624 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-08-05 11:14:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:18,624 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-08-05 11:14:18,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:14:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-08-05 11:14:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-08-05 11:14:18,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:18,626 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1] [2019-08-05 11:14:18,626 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash -497898592, now seen corresponding path program 84 times [2019-08-05 11:14:18,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:18,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:14:18,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:21,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:21,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:14:21,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:14:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:14:21,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:14:21,400 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 87 states. [2019-08-05 11:14:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,667 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-08-05 11:14:21,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:14:21,667 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 255 [2019-08-05 11:14:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,669 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:14:21,669 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:14:21,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:14:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:14:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2019-08-05 11:14:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-05 11:14:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-08-05 11:14:21,673 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-08-05 11:14:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,674 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-08-05 11:14:21,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:14:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-08-05 11:14:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-08-05 11:14:21,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,675 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1] [2019-08-05 11:14:21,675 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1914404040, now seen corresponding path program 85 times [2019-08-05 11:14:21,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:24,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:24,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:14:24,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:14:24,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:14:24,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:14:24,570 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 88 states. [2019-08-05 11:14:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:24,872 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-08-05 11:14:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:14:24,872 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 258 [2019-08-05 11:14:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:24,874 INFO L225 Difference]: With dead ends: 264 [2019-08-05 11:14:24,874 INFO L226 Difference]: Without dead ends: 264 [2019-08-05 11:14:24,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:14:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-08-05 11:14:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-08-05 11:14:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 11:14:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-08-05 11:14:24,877 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-08-05 11:14:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:24,878 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-08-05 11:14:24,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:14:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-08-05 11:14:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-08-05 11:14:24,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:24,879 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1] [2019-08-05 11:14:24,879 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -865650016, now seen corresponding path program 86 times [2019-08-05 11:14:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:24,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:14:24,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:27,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:27,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:14:27,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:14:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:14:27,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:14:27,472 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 89 states. [2019-08-05 11:14:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:27,866 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-08-05 11:14:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:14:27,866 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 261 [2019-08-05 11:14:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:27,867 INFO L225 Difference]: With dead ends: 267 [2019-08-05 11:14:27,867 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 11:14:27,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:14:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 11:14:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2019-08-05 11:14:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-08-05 11:14:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-08-05 11:14:27,870 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-08-05 11:14:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:27,871 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-08-05 11:14:27,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:14:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-08-05 11:14:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-08-05 11:14:27,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:27,872 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1] [2019-08-05 11:14:27,872 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1601663544, now seen corresponding path program 87 times [2019-08-05 11:14:27,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:27,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:14:27,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:30,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:30,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:14:30,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:14:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:14:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:14:30,672 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 90 states. [2019-08-05 11:14:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:30,965 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-08-05 11:14:30,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:14:30,966 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 264 [2019-08-05 11:14:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:30,968 INFO L225 Difference]: With dead ends: 270 [2019-08-05 11:14:30,968 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 11:14:30,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:14:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 11:14:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2019-08-05 11:14:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 11:14:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-08-05 11:14:30,972 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-08-05 11:14:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:30,972 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-08-05 11:14:30,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:14:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-08-05 11:14:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 11:14:30,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:30,973 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1] [2019-08-05 11:14:30,973 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1922337184, now seen corresponding path program 88 times [2019-08-05 11:14:30,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:30,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:14:30,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:33,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:14:33,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:14:33,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:14:33,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:14:33,906 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 91 states. [2019-08-05 11:14:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,220 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-08-05 11:14:34,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:14:34,221 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 267 [2019-08-05 11:14:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,222 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:14:34,223 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:14:34,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:14:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:14:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-08-05 11:14:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-08-05 11:14:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-08-05 11:14:34,225 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-08-05 11:14:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,225 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-08-05 11:14:34,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:14:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-08-05 11:14:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-08-05 11:14:34,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,227 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1] [2019-08-05 11:14:34,227 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,227 INFO L82 PathProgramCache]: Analyzing trace with hash -752558392, now seen corresponding path program 89 times [2019-08-05 11:14:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:36,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:14:36,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:14:36,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:14:36,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:14:36,991 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 92 states. [2019-08-05 11:14:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:37,286 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-08-05 11:14:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:14:37,286 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 270 [2019-08-05 11:14:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:37,288 INFO L225 Difference]: With dead ends: 276 [2019-08-05 11:14:37,288 INFO L226 Difference]: Without dead ends: 276 [2019-08-05 11:14:37,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:14:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-08-05 11:14:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2019-08-05 11:14:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 11:14:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-08-05 11:14:37,292 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-08-05 11:14:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:37,292 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-08-05 11:14:37,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:14:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-08-05 11:14:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-08-05 11:14:37,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:37,293 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1] [2019-08-05 11:14:37,294 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash 256546976, now seen corresponding path program 90 times [2019-08-05 11:14:37,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:37,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:14:37,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:40,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:14:40,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:14:40,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:14:40,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:14:40,478 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 93 states. [2019-08-05 11:14:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,791 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-08-05 11:14:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:14:40,791 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 273 [2019-08-05 11:14:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,793 INFO L225 Difference]: With dead ends: 279 [2019-08-05 11:14:40,793 INFO L226 Difference]: Without dead ends: 279 [2019-08-05 11:14:40,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:14:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-08-05 11:14:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-08-05 11:14:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-05 11:14:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-08-05 11:14:40,797 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-08-05 11:14:40,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,797 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-08-05 11:14:40,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:14:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-08-05 11:14:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-08-05 11:14:40,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,798 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1] [2019-08-05 11:14:40,798 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2038460360, now seen corresponding path program 91 times [2019-08-05 11:14:40,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:44,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:14:44,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:14:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:14:44,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:14:44,087 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 94 states. [2019-08-05 11:14:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:44,386 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-08-05 11:14:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:14:44,387 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 276 [2019-08-05 11:14:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:44,388 INFO L225 Difference]: With dead ends: 282 [2019-08-05 11:14:44,389 INFO L226 Difference]: Without dead ends: 282 [2019-08-05 11:14:44,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:14:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-05 11:14:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-08-05 11:14:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 11:14:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-08-05 11:14:44,393 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-08-05 11:14:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-08-05 11:14:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:14:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-08-05 11:14:44,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-08-05 11:14:44,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:44,394 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1] [2019-08-05 11:14:44,394 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:44,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1224304544, now seen corresponding path program 92 times [2019-08-05 11:14:44,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:44,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:14:44,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:47,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:14:47,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:14:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:14:47,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:14:47,342 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 95 states. [2019-08-05 11:14:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:47,664 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-08-05 11:14:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:14:47,664 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 279 [2019-08-05 11:14:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:47,666 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:14:47,666 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:14:47,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:14:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:14:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-08-05 11:14:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-08-05 11:14:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-08-05 11:14:47,671 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-08-05 11:14:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:47,671 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-08-05 11:14:47,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:14:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-08-05 11:14:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-08-05 11:14:47,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:47,673 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1] [2019-08-05 11:14:47,673 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash 388710600, now seen corresponding path program 93 times [2019-08-05 11:14:47,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:47,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:14:47,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:51,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:51,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:14:51,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:14:51,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:14:51,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:14:51,566 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 96 states. [2019-08-05 11:14:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:51,883 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2019-08-05 11:14:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:14:51,884 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 282 [2019-08-05 11:14:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:51,886 INFO L225 Difference]: With dead ends: 288 [2019-08-05 11:14:51,886 INFO L226 Difference]: Without dead ends: 288 [2019-08-05 11:14:51,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:14:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-08-05 11:14:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2019-08-05 11:14:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-08-05 11:14:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-08-05 11:14:51,889 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2019-08-05 11:14:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:51,890 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-08-05 11:14:51,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:14:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-08-05 11:14:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-08-05 11:14:51,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:51,891 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1] [2019-08-05 11:14:51,891 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash 839972512, now seen corresponding path program 94 times [2019-08-05 11:14:51,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:55,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:55,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:14:55,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:14:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:14:55,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:14:55,346 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 97 states. [2019-08-05 11:14:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:55,667 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-08-05 11:14:55,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:14:55,668 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 285 [2019-08-05 11:14:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:55,669 INFO L225 Difference]: With dead ends: 291 [2019-08-05 11:14:55,670 INFO L226 Difference]: Without dead ends: 291 [2019-08-05 11:14:55,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:14:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-08-05 11:14:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-08-05 11:14:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-08-05 11:14:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-08-05 11:14:55,673 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2019-08-05 11:14:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:55,674 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-08-05 11:14:55,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:14:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-08-05 11:14:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-08-05 11:14:55,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:55,675 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1] [2019-08-05 11:14:55,676 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:55,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1135956424, now seen corresponding path program 95 times [2019-08-05 11:14:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:55,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:14:55,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13490 backedges. 0 proven. 13490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:59,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:14:59,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:14:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:14:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:14:59,188 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 98 states. [2019-08-05 11:14:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,513 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-08-05 11:14:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:14:59,513 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 288 [2019-08-05 11:14:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,515 INFO L225 Difference]: With dead ends: 294 [2019-08-05 11:14:59,515 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 11:14:59,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:14:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 11:14:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-08-05 11:14:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 11:14:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-08-05 11:14:59,519 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2019-08-05 11:14:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,519 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-08-05 11:14:59,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:14:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-08-05 11:14:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-08-05 11:14:59,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,521 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1] [2019-08-05 11:14:59,521 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1224820128, now seen corresponding path program 96 times [2019-08-05 11:14:59,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13776 backedges. 0 proven. 13776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:02,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:02,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:15:02,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:15:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:15:02,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:15:02,732 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 99 states. [2019-08-05 11:15:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:03,065 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-08-05 11:15:03,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:15:03,065 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 291 [2019-08-05 11:15:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:03,067 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:15:03,067 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:15:03,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:15:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:15:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-08-05 11:15:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-08-05 11:15:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-08-05 11:15:03,071 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2019-08-05 11:15:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:03,071 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-08-05 11:15:03,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:15:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-08-05 11:15:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-08-05 11:15:03,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:03,072 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1] [2019-08-05 11:15:03,072 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:03,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1431395640, now seen corresponding path program 97 times [2019-08-05 11:15:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:03,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:15:03,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14065 backedges. 0 proven. 14065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:06,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:15:06,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:15:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:15:06,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:15:06,771 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 100 states. [2019-08-05 11:15:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:07,108 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-08-05 11:15:07,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:15:07,108 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 294 [2019-08-05 11:15:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,110 INFO L225 Difference]: With dead ends: 300 [2019-08-05 11:15:07,110 INFO L226 Difference]: Without dead ends: 300 [2019-08-05 11:15:07,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:15:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-08-05 11:15:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-08-05 11:15:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-08-05 11:15:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-08-05 11:15:07,114 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2019-08-05 11:15:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,114 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2019-08-05 11:15:07,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:15:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2019-08-05 11:15:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-08-05 11:15:07,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,115 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1] [2019-08-05 11:15:07,116 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2017088672, now seen corresponding path program 98 times [2019-08-05 11:15:07,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14357 backedges. 0 proven. 14357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:10,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:10,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:15:10,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:15:10,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:15:10,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:15:10,861 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 101 states. [2019-08-05 11:15:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:11,224 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-08-05 11:15:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:15:11,225 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 297 [2019-08-05 11:15:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:11,227 INFO L225 Difference]: With dead ends: 303 [2019-08-05 11:15:11,227 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 11:15:11,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:15:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 11:15:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2019-08-05 11:15:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-08-05 11:15:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-08-05 11:15:11,230 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2019-08-05 11:15:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:11,230 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-08-05 11:15:11,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:15:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-08-05 11:15:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-08-05 11:15:11,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:11,231 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1] [2019-08-05 11:15:11,231 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash 195507144, now seen corresponding path program 99 times [2019-08-05 11:15:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:11,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:15:11,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14652 backedges. 0 proven. 14652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:15:14,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:15:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:15:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:15:14,979 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 102 states. [2019-08-05 11:15:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:15,344 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-08-05 11:15:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:15:15,345 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 300 [2019-08-05 11:15:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:15,346 INFO L225 Difference]: With dead ends: 306 [2019-08-05 11:15:15,347 INFO L226 Difference]: Without dead ends: 306 [2019-08-05 11:15:15,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:15:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-08-05 11:15:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-08-05 11:15:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 11:15:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2019-08-05 11:15:15,351 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2019-08-05 11:15:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:15,351 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2019-08-05 11:15:15,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:15:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2019-08-05 11:15:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-08-05 11:15:15,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:15,353 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1] [2019-08-05 11:15:15,353 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash 371991456, now seen corresponding path program 100 times [2019-08-05 11:15:15,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:15,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:15:15,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14950 backedges. 0 proven. 14950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:19,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:19,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:15:19,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:15:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:15:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:15:19,083 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2019-08-05 11:15:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:19,454 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2019-08-05 11:15:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:15:19,454 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2019-08-05 11:15:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:19,456 INFO L225 Difference]: With dead ends: 309 [2019-08-05 11:15:19,456 INFO L226 Difference]: Without dead ends: 309 [2019-08-05 11:15:19,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:15:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-08-05 11:15:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-08-05 11:15:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-08-05 11:15:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-08-05 11:15:19,461 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 303 [2019-08-05 11:15:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:19,461 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-08-05 11:15:19,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:15:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-08-05 11:15:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-08-05 11:15:19,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:19,463 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1] [2019-08-05 11:15:19,463 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash 976159944, now seen corresponding path program 101 times [2019-08-05 11:15:19,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:19,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:15:19,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15251 backedges. 0 proven. 15251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:23,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:23,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:15:23,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:15:23,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:15:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:15:23,045 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 104 states. [2019-08-05 11:15:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:23,437 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2019-08-05 11:15:23,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:15:23,438 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 306 [2019-08-05 11:15:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:23,439 INFO L225 Difference]: With dead ends: 312 [2019-08-05 11:15:23,439 INFO L226 Difference]: Without dead ends: 312 [2019-08-05 11:15:23,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:15:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-08-05 11:15:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2019-08-05 11:15:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-08-05 11:15:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2019-08-05 11:15:23,444 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 306 [2019-08-05 11:15:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:23,444 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2019-08-05 11:15:23,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:15:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2019-08-05 11:15:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-08-05 11:15:23,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:23,446 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1] [2019-08-05 11:15:23,446 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -448351584, now seen corresponding path program 102 times [2019-08-05 11:15:23,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:23,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:15:23,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 0 proven. 15555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:27,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:15:27,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:15:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:15:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:15:27,868 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 105 states. [2019-08-05 11:15:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,243 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-08-05 11:15:28,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:15:28,243 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 309 [2019-08-05 11:15:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,244 INFO L225 Difference]: With dead ends: 315 [2019-08-05 11:15:28,244 INFO L226 Difference]: Without dead ends: 315 [2019-08-05 11:15:28,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:15:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-08-05 11:15:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-08-05 11:15:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-08-05 11:15:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-08-05 11:15:28,248 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 309 [2019-08-05 11:15:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,249 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-08-05 11:15:28,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:15:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-08-05 11:15:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-08-05 11:15:28,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,250 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1] [2019-08-05 11:15:28,250 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash 500569544, now seen corresponding path program 103 times [2019-08-05 11:15:28,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15862 backedges. 0 proven. 15862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:32,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:32,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:15:32,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:15:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:15:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:15:32,270 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 106 states. [2019-08-05 11:15:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:32,667 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2019-08-05 11:15:32,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:15:32,667 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 312 [2019-08-05 11:15:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:32,668 INFO L225 Difference]: With dead ends: 318 [2019-08-05 11:15:32,668 INFO L226 Difference]: Without dead ends: 318 [2019-08-05 11:15:32,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:15:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-08-05 11:15:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2019-08-05 11:15:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 11:15:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-08-05 11:15:32,673 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 312 [2019-08-05 11:15:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:32,673 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-08-05 11:15:32,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:15:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-08-05 11:15:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-08-05 11:15:32,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:32,674 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1] [2019-08-05 11:15:32,675 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash 335151520, now seen corresponding path program 104 times [2019-08-05 11:15:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:32,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:15:32,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16172 backedges. 0 proven. 16172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:36,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:36,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:15:36,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:15:36,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:15:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:15:36,771 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 107 states. [2019-08-05 11:15:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:37,151 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-08-05 11:15:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:15:37,152 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 315 [2019-08-05 11:15:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:37,153 INFO L225 Difference]: With dead ends: 321 [2019-08-05 11:15:37,153 INFO L226 Difference]: Without dead ends: 321 [2019-08-05 11:15:37,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:15:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-08-05 11:15:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2019-08-05 11:15:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-08-05 11:15:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2019-08-05 11:15:37,157 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 315 [2019-08-05 11:15:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:37,157 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2019-08-05 11:15:37,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:15:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2019-08-05 11:15:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-08-05 11:15:37,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:37,159 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1] [2019-08-05 11:15:37,159 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1305712952, now seen corresponding path program 105 times [2019-08-05 11:15:37,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:37,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:15:37,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 16485 backedges. 0 proven. 16485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:15:41,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:15:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:15:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:15:41,377 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 108 states. [2019-08-05 11:15:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:41,783 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2019-08-05 11:15:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:15:41,783 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 318 [2019-08-05 11:15:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:41,784 INFO L225 Difference]: With dead ends: 324 [2019-08-05 11:15:41,784 INFO L226 Difference]: Without dead ends: 324 [2019-08-05 11:15:41,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:15:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-08-05 11:15:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2019-08-05 11:15:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-08-05 11:15:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-08-05 11:15:41,789 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 318 [2019-08-05 11:15:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:41,789 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2019-08-05 11:15:41,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:15:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2019-08-05 11:15:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-08-05 11:15:41,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:41,791 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1] [2019-08-05 11:15:41,791 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1018564768, now seen corresponding path program 106 times [2019-08-05 11:15:41,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:41,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:15:41,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16801 backedges. 0 proven. 16801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:15:45,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:15:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:15:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:15:45,867 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 109 states. [2019-08-05 11:15:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:46,256 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-08-05 11:15:46,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:15:46,257 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 321 [2019-08-05 11:15:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:46,258 INFO L225 Difference]: With dead ends: 327 [2019-08-05 11:15:46,258 INFO L226 Difference]: Without dead ends: 327 [2019-08-05 11:15:46,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:15:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-08-05 11:15:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2019-08-05 11:15:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-08-05 11:15:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-08-05 11:15:46,261 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 321 [2019-08-05 11:15:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:46,261 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-08-05 11:15:46,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:15:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-08-05 11:15:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-08-05 11:15:46,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:46,262 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1] [2019-08-05 11:15:46,263 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:46,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash 113375176, now seen corresponding path program 107 times [2019-08-05 11:15:46,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:46,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:15:46,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17120 backedges. 0 proven. 17120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:50,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:50,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:15:50,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:15:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:15:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:15:50,500 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 110 states. [2019-08-05 11:15:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:50,901 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-08-05 11:15:50,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:15:50,902 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 324 [2019-08-05 11:15:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:50,903 INFO L225 Difference]: With dead ends: 330 [2019-08-05 11:15:50,903 INFO L226 Difference]: Without dead ends: 330 [2019-08-05 11:15:50,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:15:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-08-05 11:15:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-08-05 11:15:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-08-05 11:15:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2019-08-05 11:15:50,907 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 324 [2019-08-05 11:15:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:50,907 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2019-08-05 11:15:50,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:15:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2019-08-05 11:15:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-08-05 11:15:50,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:50,908 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1] [2019-08-05 11:15:50,908 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1709891488, now seen corresponding path program 108 times [2019-08-05 11:15:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:50,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:15:50,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 0 proven. 17442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:55,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:55,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:15:55,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:15:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:15:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:15:55,223 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 111 states. [2019-08-05 11:15:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:55,621 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2019-08-05 11:15:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:15:55,622 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 327 [2019-08-05 11:15:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:55,623 INFO L225 Difference]: With dead ends: 333 [2019-08-05 11:15:55,623 INFO L226 Difference]: Without dead ends: 333 [2019-08-05 11:15:55,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:15:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-08-05 11:15:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-08-05 11:15:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-08-05 11:15:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-08-05 11:15:55,627 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 327 [2019-08-05 11:15:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:55,627 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-08-05 11:15:55,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:15:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-08-05 11:15:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-08-05 11:15:55,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:55,628 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1] [2019-08-05 11:15:55,628 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:55,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1059506376, now seen corresponding path program 109 times [2019-08-05 11:15:55,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:55,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:15:55,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 17767 backedges. 0 proven. 17767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:59,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:59,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:15:59,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:15:59,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:15:59,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:15:59,775 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 112 states. [2019-08-05 11:16:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:00,303 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2019-08-05 11:16:00,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:16:00,303 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 330 [2019-08-05 11:16:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:00,304 INFO L225 Difference]: With dead ends: 336 [2019-08-05 11:16:00,304 INFO L226 Difference]: Without dead ends: 336 [2019-08-05 11:16:00,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:16:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-08-05 11:16:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-08-05 11:16:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-08-05 11:16:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2019-08-05 11:16:00,307 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 330 [2019-08-05 11:16:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:00,307 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2019-08-05 11:16:00,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:16:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2019-08-05 11:16:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-08-05 11:16:00,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:00,308 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1] [2019-08-05 11:16:00,308 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 34107040, now seen corresponding path program 110 times [2019-08-05 11:16:00,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:00,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:16:00,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:04,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:04,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:16:04,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:16:04,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:16:04,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:16:04,531 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 113 states. [2019-08-05 11:16:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:05,080 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-08-05 11:16:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:16:05,080 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 333 [2019-08-05 11:16:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:05,081 INFO L225 Difference]: With dead ends: 339 [2019-08-05 11:16:05,081 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 11:16:05,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:16:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 11:16:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2019-08-05 11:16:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-08-05 11:16:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-08-05 11:16:05,085 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 333 [2019-08-05 11:16:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:05,085 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-08-05 11:16:05,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:16:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-08-05 11:16:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-08-05 11:16:05,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:05,086 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 111, 1, 1, 1] [2019-08-05 11:16:05,086 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:05,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1830102584, now seen corresponding path program 111 times [2019-08-05 11:16:05,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:05,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:16:05,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18426 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:09,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:09,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:16:09,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:16:09,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:16:09,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:16:09,472 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 114 states. [2019-08-05 11:16:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:09,901 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2019-08-05 11:16:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:16:09,901 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 336 [2019-08-05 11:16:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:09,902 INFO L225 Difference]: With dead ends: 342 [2019-08-05 11:16:09,902 INFO L226 Difference]: Without dead ends: 342 [2019-08-05 11:16:09,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:16:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-08-05 11:16:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-08-05 11:16:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-08-05 11:16:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2019-08-05 11:16:09,904 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 336 [2019-08-05 11:16:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:09,905 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2019-08-05 11:16:09,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:16:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2019-08-05 11:16:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-08-05 11:16:09,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:09,906 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1] [2019-08-05 11:16:09,906 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:09,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash -276906592, now seen corresponding path program 112 times [2019-08-05 11:16:09,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:09,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:16:09,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18760 backedges. 0 proven. 18760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:14,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:14,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:16:14,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:16:14,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:16:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:16:14,555 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 115 states. [2019-08-05 11:16:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:15,005 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-08-05 11:16:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:16:15,006 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 339 [2019-08-05 11:16:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:15,007 INFO L225 Difference]: With dead ends: 345 [2019-08-05 11:16:15,007 INFO L226 Difference]: Without dead ends: 345 [2019-08-05 11:16:15,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:16:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-08-05 11:16:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-08-05 11:16:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-08-05 11:16:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2019-08-05 11:16:15,010 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 339 [2019-08-05 11:16:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:15,011 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2019-08-05 11:16:15,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:16:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2019-08-05 11:16:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-08-05 11:16:15,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:15,012 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1] [2019-08-05 11:16:15,012 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:15,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:15,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1302211272, now seen corresponding path program 113 times [2019-08-05 11:16:15,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:15,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:16:15,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19097 backedges. 0 proven. 19097 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:19,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:19,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:16:19,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:16:19,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:16:19,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:16:19,667 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 116 states. [2019-08-05 11:16:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:20,098 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2019-08-05 11:16:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:16:20,099 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 342 [2019-08-05 11:16:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:20,100 INFO L225 Difference]: With dead ends: 348 [2019-08-05 11:16:20,100 INFO L226 Difference]: Without dead ends: 348 [2019-08-05 11:16:20,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:16:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-08-05 11:16:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2019-08-05 11:16:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-08-05 11:16:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-08-05 11:16:20,105 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 342 [2019-08-05 11:16:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:20,106 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-08-05 11:16:20,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:16:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-08-05 11:16:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-08-05 11:16:20,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:20,107 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1] [2019-08-05 11:16:20,107 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:20,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2025704608, now seen corresponding path program 114 times [2019-08-05 11:16:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:20,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:16:20,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 19437 backedges. 0 proven. 19437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:24,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:24,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:16:24,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:16:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:16:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:16:24,901 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 117 states. [2019-08-05 11:16:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:25,392 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-08-05 11:16:25,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:16:25,392 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 345 [2019-08-05 11:16:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:25,393 INFO L225 Difference]: With dead ends: 351 [2019-08-05 11:16:25,393 INFO L226 Difference]: Without dead ends: 351 [2019-08-05 11:16:25,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:16:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-08-05 11:16:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-08-05 11:16:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-05 11:16:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-08-05 11:16:25,395 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 345 [2019-08-05 11:16:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:25,395 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-08-05 11:16:25,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:16:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-08-05 11:16:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-08-05 11:16:25,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:25,397 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1] [2019-08-05 11:16:25,397 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash -825181240, now seen corresponding path program 115 times [2019-08-05 11:16:25,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:25,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:16:25,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:16:26,436 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:16:26,436 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:16:26,442 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:16:26,442 INFO L202 PluginConnector]: Adding new model loop-skips-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:26 BoogieIcfgContainer [2019-08-05 11:16:26,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:26,446 INFO L168 Benchmark]: Toolchain (without parser) took 239556.49 ms. Allocated memory was 134.2 MB in the beginning and 840.4 MB in the end (delta: 706.2 MB). Free memory was 111.8 MB in the beginning and 326.4 MB in the end (delta: -214.6 MB). Peak memory consumption was 491.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:26,447 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:26,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 110.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:26,449 INFO L168 Benchmark]: Boogie Preprocessor took 23.83 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:26,449 INFO L168 Benchmark]: RCFGBuilder took 339.65 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 100.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:26,450 INFO L168 Benchmark]: TraceAbstraction took 239151.78 ms. Allocated memory was 134.2 MB in the beginning and 840.4 MB in the end (delta: 706.2 MB). Free memory was 99.8 MB in the beginning and 326.4 MB in the end (delta: -226.6 MB). Peak memory consumption was 479.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:26,455 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 110.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.83 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.65 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 100.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239151.78 ms. Allocated memory was 134.2 MB in the beginning and 840.4 MB in the end (delta: 706.2 MB). Free memory was 99.8 MB in the beginning and 326.4 MB in the end (delta: -226.6 MB). Peak memory consumption was 479.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 10]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 10). Cancelled while BasicCegarLoop was analyzing trace of length 349 with TraceHistMax 115,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 349 with TraceHistMax 115,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 9]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 9). Cancelled while BasicCegarLoop was analyzing trace of length 349 with TraceHistMax 115,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. TIMEOUT Result, 239.0s OverallTime, 117 OverallIterations, 115 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 467 SDtfs, 13340 SDslu, 6670 SDs, 0 SdLazy, 15258 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19897 GetRequests, 13227 SyntacticMatches, 0 SemanticMatches, 6670 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 203.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 116 MinimizatonAttempts, 230 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 208.6s InterpolantComputationTime, 20013 NumberOfCodeBlocks, 20013 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 19897 ConstructedInterpolants, 0 QuantifiedInterpolants, 13707429 SizeOfPredicates, 115 NumberOfNonLiveVariables, 27146 ConjunctsInSsa, 6786 ConjunctsInUnsatCore, 116 InterpolantComputations, 2 PerfectInterpolantSequences, 0/747270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown