java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:25:48,691 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:25:48,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:25:48,706 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:25:48,706 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:25:48,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:25:48,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:25:48,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:25:48,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:25:48,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:25:48,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:25:48,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:25:48,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:25:48,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:25:48,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:25:48,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:25:48,719 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:25:48,721 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:25:48,723 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:25:48,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:25:48,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:25:48,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:25:48,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:25:48,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:25:48,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:25:48,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:25:48,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:25:48,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:25:48,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:25:48,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:25:48,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:25:48,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:25:48,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:25:48,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:25:48,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:25:48,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:25:48,738 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:25:48,746 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:25:48,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:25:48,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:25:48,748 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:25:48,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:25:48,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:25:48,749 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:25:48,749 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:25:48,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:25:48,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:25:48,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:25:48,813 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:25:48,814 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:25:48,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl [2018-07-25 13:25:48,815 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl' [2018-07-25 13:25:48,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:25:48,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:25:48,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:25:48,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:25:48,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:25:48,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:25:48,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:25:48,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:25:48,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:25:48,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:48,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:25:48,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:25:48,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:25:48,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:25:48,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/1) ... [2018-07-25 13:25:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:25:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:25:49,186 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:25:49,187 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:25:49 BoogieIcfgContainer [2018-07-25 13:25:49,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:25:49,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:25:49,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:25:49,192 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:25:49,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:48" (1/2) ... [2018-07-25 13:25:49,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8e7139 and model type jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:25:49, skipping insertion in model container [2018-07-25 13:25:49,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:25:49" (2/2) ... [2018-07-25 13:25:49,198 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5.i_2.bpl [2018-07-25 13:25:49,208 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:25:49,217 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:25:49,261 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:25:49,262 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:25:49,262 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:25:49,263 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:25:49,263 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:25:49,263 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:25:49,263 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:25:49,263 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:25:49,264 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:25:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:25:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:25:49,285 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:49,286 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:25:49,287 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-07-25 13:25:49,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:49,404 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:25:49,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:25:49,409 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:25:49,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:25:49,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:25:49,426 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-25 13:25:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:49,468 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-25 13:25:49,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:25:49,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:25:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:49,481 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:25:49,482 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:25:49,485 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:25:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:25:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-25 13:25:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:25:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:25:49,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:25:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:49,523 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:25:49,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:25:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:25:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:25:49,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:49,524 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:25:49,525 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-07-25 13:25:49,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:49,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:49,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:25:49,618 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:25:49,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:25:49,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:25:49,619 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:25:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:49,755 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:25:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:25:49,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:25:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:49,756 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:25:49,756 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:25:49,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:25:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:25:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:25:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:25:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:25:49,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:25:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:49,765 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:25:49,765 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:25:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:25:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:25:49,766 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:49,766 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:25:49,767 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-07-25 13:25:49,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:49,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:49,857 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:25:49,859 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:25:49,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:25:49,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:25:49,861 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-07-25 13:25:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:50,004 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:25:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:25:50,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 13:25:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:50,008 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:25:50,008 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:25:50,009 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:25:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:25:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:25:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:25:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:25:50,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:25:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:50,023 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:25:50,023 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:25:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:25:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:25:50,024 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:50,024 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 13:25:50,024 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2018-07-25 13:25:50,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:50,182 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:50,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:25:50,184 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:25:50,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:25:50,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:25:50,186 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-07-25 13:25:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:50,323 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:25:50,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:25:50,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 13:25:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:50,325 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:25:50,325 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:25:50,326 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:25:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:25:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:25:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:25:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:25:50,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 13:25:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:50,332 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:25:50,333 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:25:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:25:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:25:50,333 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:50,334 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 13:25:50,334 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2018-07-25 13:25:50,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:50,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:50,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:25:50,431 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:25:50,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:25:50,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:25:50,434 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2018-07-25 13:25:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:50,568 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:25:50,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:25:50,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 13:25:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:50,571 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:25:50,571 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:25:50,576 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:25:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:25:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:25:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:25:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:25:50,588 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 13:25:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:50,588 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:25:50,589 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:25:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:25:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:25:50,590 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:50,590 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 13:25:50,593 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2018-07-25 13:25:50,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:50,702 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:50,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:25:50,702 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:25:50,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:25:50,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:25:50,704 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2018-07-25 13:25:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:50,803 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:25:50,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:25:50,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-07-25 13:25:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:50,805 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:25:50,805 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:25:50,806 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:25:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:25:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:25:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:25:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:25:50,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 13:25:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:50,815 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:25:50,815 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:25:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:25:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:25:50,817 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:50,817 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 13:25:50,817 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2018-07-25 13:25:50,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:50,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:50,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:25:50,934 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:25:50,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:25:50,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:25:50,935 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2018-07-25 13:25:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:51,084 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:25:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:25:51,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-07-25 13:25:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:51,087 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:25:51,087 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:25:51,088 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:25:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:25:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:25:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:25:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:25:51,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 13:25:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:51,099 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:25:51,099 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:25:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:25:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:25:51,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:51,101 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 13:25:51,102 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:51,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2018-07-25 13:25:51,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:51,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:51,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:25:51,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:25:51,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:25:51,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:25:51,213 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-07-25 13:25:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:51,376 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:25:51,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:25:51,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 13:25:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:51,380 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:25:51,380 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:25:51,381 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:25:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:25:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:25:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:25:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:25:51,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 13:25:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:51,393 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:25:51,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:25:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:25:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:25:51,395 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:51,395 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 13:25:51,396 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2018-07-25 13:25:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:51,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:51,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:25:51,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:25:51,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:25:51,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:25:51,505 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2018-07-25 13:25:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:51,704 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:25:51,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:25:51,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 13:25:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:51,707 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:25:51,707 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:25:51,708 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:25:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:25:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:25:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:25:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:25:51,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 13:25:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:51,724 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:25:51,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:25:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:25:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:25:51,725 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:51,726 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 13:25:51,726 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:51,727 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2018-07-25 13:25:51,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:51,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:51,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:25:51,857 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:25:51,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:25:51,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:25:51,858 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2018-07-25 13:25:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:52,076 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:25:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:25:52,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-25 13:25:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:52,077 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:25:52,077 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:25:52,078 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:25:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:25:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:25:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:25:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:25:52,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 13:25:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:52,092 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:25:52,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:25:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:25:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:25:52,093 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:52,093 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 13:25:52,093 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2018-07-25 13:25:52,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:52,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:52,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:25:52,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:25:52,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:25:52,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:25:52,213 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2018-07-25 13:25:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:52,447 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:25:52,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:25:52,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-07-25 13:25:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:52,449 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:25:52,449 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:25:52,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:25:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:25:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:25:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:25:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:25:52,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 13:25:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:52,470 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:25:52,470 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:25:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:25:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:25:52,471 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:52,472 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 13:25:52,472 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2018-07-25 13:25:52,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:52,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:52,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:25:52,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:25:52,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:25:52,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:25:52,598 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2018-07-25 13:25:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:52,835 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:25:52,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:25:52,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-07-25 13:25:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:52,837 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:25:52,837 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:25:52,838 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:25:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:25:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:25:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:25:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:25:52,851 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 13:25:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:52,852 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:25:52,852 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:25:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:25:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:25:52,854 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:52,854 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 13:25:52,854 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2018-07-25 13:25:52,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:53,007 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:53,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:25:53,007 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:25:53,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:25:53,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:25:53,009 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2018-07-25 13:25:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:53,281 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:25:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:25:53,282 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-07-25 13:25:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:53,283 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:25:53,284 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:25:53,285 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:25:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:25:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:25:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:25:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:25:53,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 13:25:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:53,301 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:25:53,301 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:25:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:25:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:25:53,307 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:53,307 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 13:25:53,308 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2018-07-25 13:25:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:53,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:53,476 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:25:53,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:25:53,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:25:53,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:25:53,481 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2018-07-25 13:25:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:53,849 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:25:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:25:53,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-07-25 13:25:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:53,851 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:25:53,851 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:25:53,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:25:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:25:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:25:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:25:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:25:53,868 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 13:25:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:53,868 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:25:53,868 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:25:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:25:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:25:53,871 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:53,871 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 13:25:53,872 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2018-07-25 13:25:53,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:54,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:54,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:25:54,014 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:25:54,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:25:54,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:25:54,014 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2018-07-25 13:25:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:54,314 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:25:54,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:25:54,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-07-25 13:25:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:54,315 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:25:54,315 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:25:54,316 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:25:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:25:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:25:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:25:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:25:54,331 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 13:25:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:54,331 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:25:54,332 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:25:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:25:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:25:54,332 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:54,333 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 13:25:54,333 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:54,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2018-07-25 13:25:54,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:54,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:54,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:25:54,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:25:54,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:25:54,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:25:54,510 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2018-07-25 13:25:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:54,842 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:25:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:25:54,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-07-25 13:25:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:54,845 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:25:54,845 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:25:54,846 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:25:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:25:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:25:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:25:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:25:54,863 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 13:25:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:54,863 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:25:54,863 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:25:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:25:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:25:54,864 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:54,864 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 13:25:54,865 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2018-07-25 13:25:54,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:55,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:55,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:25:55,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:25:55,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:25:55,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:25:55,041 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2018-07-25 13:25:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:55,396 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:25:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:25:55,396 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-07-25 13:25:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:55,397 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:25:55,397 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:25:55,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:25:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:25:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:25:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:25:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:25:55,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 13:25:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:55,421 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:25:55,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:25:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:25:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:25:55,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:55,423 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 13:25:55,425 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2018-07-25 13:25:55,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:55,603 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:55,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:25:55,604 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:25:55,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:25:55,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:25:55,605 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2018-07-25 13:25:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:55,967 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:25:55,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:25:55,968 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-07-25 13:25:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:55,968 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:25:55,968 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:25:55,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:25:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:25:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:25:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:25:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:25:55,989 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 13:25:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:55,990 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:25:55,990 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:25:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:25:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:25:55,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:55,991 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 13:25:55,991 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:55,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2018-07-25 13:25:55,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:56,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:56,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:25:56,209 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:25:56,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:25:56,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:25:56,210 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2018-07-25 13:25:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:56,660 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:25:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:25:56,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2018-07-25 13:25:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:56,661 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:25:56,661 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:25:56,662 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:25:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:25:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:25:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:25:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:25:56,678 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 13:25:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:56,679 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:25:56,679 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:25:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:25:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:25:56,680 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:56,680 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 13:25:56,680 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:56,681 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2018-07-25 13:25:56,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:56,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:56,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:25:56,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:25:56,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:25:56,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:25:56,861 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2018-07-25 13:25:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:57,283 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:25:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:25:57,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-07-25 13:25:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:57,284 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:25:57,285 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:25:57,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:25:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:25:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:25:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:25:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:25:57,305 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 13:25:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:57,305 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:25:57,305 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:25:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:25:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:25:57,306 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:57,306 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 13:25:57,306 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2018-07-25 13:25:57,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:57,502 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:57,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:25:57,503 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:25:57,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:25:57,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:25:57,504 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2018-07-25 13:25:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:57,959 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:25:57,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:25:57,960 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2018-07-25 13:25:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:57,960 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:25:57,960 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:25:57,962 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:25:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:25:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:25:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:25:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:25:57,984 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 13:25:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:57,984 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:25:57,985 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:25:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:25:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:25:57,985 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:57,985 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 13:25:57,986 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2018-07-25 13:25:57,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:58,200 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:58,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:25:58,201 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:25:58,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:25:58,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:25:58,204 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2018-07-25 13:25:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:58,710 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:25:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:25:58,711 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-07-25 13:25:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:58,711 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:25:58,711 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:25:58,716 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:25:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:25:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:25:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:25:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:25:58,737 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 13:25:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:58,737 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:25:58,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:25:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:25:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:25:58,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:58,738 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 13:25:58,738 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2018-07-25 13:25:58,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:58,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:58,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:25:58,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:25:58,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:25:58,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:25:58,987 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2018-07-25 13:25:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:59,648 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:25:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:25:59,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-07-25 13:25:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:59,649 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:25:59,650 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:25:59,651 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:25:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:25:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:25:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:25:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:25:59,682 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 13:25:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:59,682 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:25:59,682 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:25:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:25:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:25:59,683 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:59,683 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 13:25:59,685 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2018-07-25 13:25:59,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:59,915 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:59,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:25:59,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:25:59,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:25:59,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:25:59,917 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2018-07-25 13:26:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:00,445 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:26:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:26:00,445 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2018-07-25 13:26:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:00,446 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:26:00,446 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:26:00,448 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:26:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:26:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:26:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:26:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:26:00,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 13:26:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:00,471 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:26:00,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:26:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:26:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:26:00,471 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:00,471 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 13:26:00,472 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2018-07-25 13:26:00,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:00,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:00,710 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:26:00,710 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:26:00,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:26:00,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:26:00,711 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2018-07-25 13:26:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:01,273 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:26:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:26:01,274 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2018-07-25 13:26:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:01,274 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:26:01,275 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:26:01,276 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:26:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:26:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:26:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:26:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:26:01,311 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 13:26:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:01,311 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:26:01,311 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:26:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:26:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:26:01,312 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:01,312 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 13:26:01,313 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2018-07-25 13:26:01,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:01,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:01,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:26:01,583 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:26:01,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:26:01,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:26:01,584 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2018-07-25 13:26:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:02,206 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:26:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:26:02,206 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-07-25 13:26:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:02,207 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:26:02,207 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:26:02,210 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:26:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:26:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:26:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:26:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:26:02,237 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 13:26:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:02,237 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:26:02,237 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:26:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:26:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:26:02,238 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:02,238 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 13:26:02,239 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2018-07-25 13:26:02,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:02,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:02,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:26:02,552 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:26:02,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:26:02,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:26:02,553 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2018-07-25 13:26:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:03,338 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:26:03,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:26:03,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-07-25 13:26:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:03,339 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:26:03,340 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:26:03,342 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:26:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:26:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:26:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:26:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:26:03,369 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 13:26:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:03,369 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:26:03,369 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:26:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:26:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:26:03,370 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:03,370 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 13:26:03,370 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2018-07-25 13:26:03,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:03,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:03,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:26:03,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:26:03,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:26:03,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:26:03,666 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2018-07-25 13:26:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:04,361 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:26:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:26:04,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2018-07-25 13:26:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:04,362 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:26:04,362 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:26:04,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:26:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:26:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:26:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:26:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:26:04,395 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 13:26:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:04,395 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:26:04,395 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:26:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:26:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:26:04,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:04,396 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 13:26:04,396 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2018-07-25 13:26:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:04,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:04,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:26:04,677 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:26:04,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:26:04,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:26:04,678 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2018-07-25 13:26:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:05,390 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:26:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:26:05,390 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2018-07-25 13:26:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:05,391 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:26:05,391 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:26:05,394 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:26:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:26:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:26:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:26:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:26:05,424 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 13:26:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:05,424 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:26:05,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:26:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:26:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:26:05,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:05,425 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 13:26:05,425 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2018-07-25 13:26:05,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:05,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:05,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:26:05,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:26:05,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:26:05,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:26:05,716 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2018-07-25 13:26:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:06,526 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:26:06,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:26:06,526 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2018-07-25 13:26:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:06,527 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:26:06,527 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:26:06,529 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:26:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:26:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:26:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:26:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:26:06,560 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 13:26:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:06,561 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:26:06,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:26:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:26:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:26:06,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:06,562 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 13:26:06,562 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2018-07-25 13:26:06,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:06,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:06,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:26:06,865 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:26:06,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:26:06,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:26:06,866 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2018-07-25 13:26:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:07,626 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:26:07,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:26:07,626 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2018-07-25 13:26:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:07,627 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:26:07,627 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:26:07,629 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:26:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:26:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:26:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:26:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:26:07,656 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 13:26:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:07,656 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:26:07,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:26:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:26:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:26:07,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:07,657 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 13:26:07,658 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2018-07-25 13:26:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:07,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:07,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:26:07,974 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:26:07,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:26:07,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:26:07,976 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2018-07-25 13:26:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:08,769 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:26:08,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:26:08,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-07-25 13:26:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:08,771 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:26:08,771 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:26:08,773 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:26:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:26:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:26:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:26:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:26:08,802 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 13:26:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:08,802 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:26:08,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:26:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:26:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:26:08,804 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:08,804 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 13:26:08,804 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2018-07-25 13:26:08,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:09,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:09,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:26:09,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:26:09,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:26:09,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:26:09,176 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2018-07-25 13:26:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:10,013 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:26:10,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:26:10,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2018-07-25 13:26:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:10,014 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:26:10,014 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:26:10,015 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:26:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:26:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:26:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:26:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:26:10,048 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 13:26:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:10,048 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:26:10,048 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:26:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:26:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:26:10,049 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:10,049 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 13:26:10,049 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2018-07-25 13:26:10,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:10,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:10,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:26:10,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:26:10,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:26:10,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:26:10,365 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2018-07-25 13:26:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:11,170 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:26:11,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:26:11,170 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2018-07-25 13:26:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:11,171 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:26:11,171 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:26:11,172 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:26:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:26:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:26:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:26:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:26:11,199 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 13:26:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:11,200 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:26:11,200 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:26:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:26:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:26:11,201 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:11,201 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 13:26:11,201 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2018-07-25 13:26:11,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:11,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:11,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:26:11,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:26:11,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:26:11,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:26:11,520 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2018-07-25 13:26:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:12,349 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:26:12,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:26:12,349 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-07-25 13:26:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:12,350 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:26:12,350 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:26:12,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:26:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:26:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:26:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:26:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:26:12,378 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 13:26:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:12,378 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:26:12,378 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:26:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:26:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:26:12,379 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:12,379 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 13:26:12,379 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:12,380 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2018-07-25 13:26:12,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:12,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:12,717 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:12,717 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:26:12,717 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:26:12,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:26:12,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:26:12,718 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2018-07-25 13:26:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:13,531 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:26:13,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:26:13,531 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2018-07-25 13:26:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:13,532 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:26:13,532 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:26:13,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:26:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:26:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:26:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:26:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:26:13,565 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 13:26:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:13,566 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:26:13,566 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:26:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:26:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:26:13,567 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:13,567 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 13:26:13,567 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2018-07-25 13:26:13,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:13,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:13,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:26:13,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:26:13,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:26:13,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:26:13,889 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2018-07-25 13:26:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:14,757 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:26:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:26:14,757 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2018-07-25 13:26:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:14,758 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:26:14,758 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:26:14,759 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:26:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:26:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:26:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:26:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:26:14,786 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 13:26:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:14,787 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:26:14,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:26:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:26:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:26:14,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:14,788 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 13:26:14,788 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:14,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2018-07-25 13:26:14,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:15,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:15,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:26:15,118 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:26:15,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:26:15,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:26:15,119 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2018-07-25 13:26:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:16,167 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:26:16,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:26:16,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2018-07-25 13:26:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:16,169 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:26:16,169 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:26:16,171 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:26:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:26:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:26:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:26:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:26:16,211 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 13:26:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:16,211 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:26:16,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:26:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:26:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:26:16,212 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:16,212 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 13:26:16,213 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2018-07-25 13:26:16,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:16,560 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:16,560 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:26:16,560 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:26:16,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:26:16,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:26:16,561 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2018-07-25 13:26:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:17,376 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:26:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:26:17,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2018-07-25 13:26:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:17,377 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:26:17,377 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:26:17,378 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:26:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:26:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:26:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:26:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:26:17,411 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 13:26:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:17,412 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:26:17,412 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:26:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:26:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:26:17,413 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:17,413 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 13:26:17,413 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2018-07-25 13:26:17,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:17,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:17,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:26:17,780 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:26:17,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:26:17,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:26:17,780 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2018-07-25 13:26:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:18,601 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:26:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:26:18,602 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2018-07-25 13:26:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:18,603 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:26:18,603 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:26:18,604 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:26:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:26:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:26:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:26:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:26:18,629 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 13:26:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:18,630 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:26:18,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:26:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:26:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:26:18,630 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:18,631 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 13:26:18,631 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2018-07-25 13:26:18,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:19,033 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:19,033 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:26:19,033 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:26:19,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:26:19,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:26:19,034 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2018-07-25 13:26:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:19,876 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:26:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:26:19,876 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2018-07-25 13:26:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:19,877 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:26:19,877 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:26:19,879 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:26:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:26:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:26:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:26:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:26:19,910 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 13:26:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:19,911 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:26:19,911 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:26:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:26:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:26:19,911 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:19,912 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 13:26:19,912 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2018-07-25 13:26:19,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:20,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:20,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:26:20,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:26:20,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:26:20,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:26:20,307 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2018-07-25 13:26:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:21,194 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:26:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:26:21,195 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2018-07-25 13:26:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:21,195 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:26:21,195 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:26:21,196 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:26:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:26:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:26:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:26:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:26:21,230 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 13:26:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:21,230 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:26:21,230 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:26:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:26:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:26:21,231 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:21,231 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 13:26:21,231 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:21,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2018-07-25 13:26:21,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:21,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:21,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:26:21,691 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:26:21,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:26:21,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:26:21,692 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2018-07-25 13:26:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:22,526 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:26:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:26:22,526 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2018-07-25 13:26:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:22,527 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:26:22,527 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:26:22,529 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:26:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:26:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:26:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:26:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:26:22,564 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 13:26:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:22,564 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:26:22,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:26:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:26:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:26:22,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:22,566 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 13:26:22,566 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2018-07-25 13:26:22,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:22,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:22,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:26:22,956 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:26:22,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:26:22,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:26:22,957 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2018-07-25 13:26:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:23,794 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:26:23,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:26:23,794 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2018-07-25 13:26:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:23,795 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:26:23,795 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:26:23,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:26:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:26:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:26:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:26:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:26:23,830 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 13:26:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:23,830 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:26:23,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:26:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:26:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:26:23,831 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:23,831 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 13:26:23,831 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2018-07-25 13:26:23,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:24,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:24,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:26:24,351 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:26:24,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:26:24,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:26:24,352 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2018-07-25 13:26:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:25,406 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:26:25,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:26:25,407 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2018-07-25 13:26:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:25,408 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:26:25,408 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:26:25,409 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:26:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:26:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:26:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:26:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:26:25,458 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 13:26:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:25,458 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:26:25,458 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:26:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:26:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:26:25,459 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:25,459 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 13:26:25,461 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2018-07-25 13:26:25,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:25,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:25,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:26:25,856 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:26:25,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:26:25,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:26:25,857 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2018-07-25 13:26:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:26,777 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:26:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:26:26,778 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2018-07-25 13:26:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:26,778 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:26:26,778 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:26:26,779 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:26:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:26:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:26:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:26:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:26:26,812 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 13:26:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:26,812 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:26:26,813 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:26:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:26:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:26:26,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:26,813 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 13:26:26,814 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2018-07-25 13:26:26,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:27,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:27,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:26:27,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:26:27,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:26:27,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:26:27,245 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2018-07-25 13:26:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:28,189 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:26:28,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:26:28,189 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2018-07-25 13:26:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:28,190 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:26:28,190 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:26:28,191 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:26:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:26:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:26:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:26:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:26:28,234 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 13:26:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:28,234 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:26:28,234 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:26:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:26:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:26:28,235 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:28,235 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 13:26:28,236 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2018-07-25 13:26:28,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:28,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:28,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:26:28,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:26:28,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:26:28,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:26:28,716 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2018-07-25 13:26:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:29,711 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:26:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:26:29,712 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2018-07-25 13:26:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:29,712 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:26:29,713 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:26:29,714 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:26:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:26:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:26:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:26:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:26:29,756 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 13:26:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:29,756 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:26:29,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:26:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:26:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:26:29,757 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:29,757 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 13:26:29,758 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:29,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2018-07-25 13:26:29,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:30,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:30,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:26:30,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:26:30,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:26:30,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:26:30,143 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2018-07-25 13:26:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:31,216 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:26:31,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:26:31,216 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2018-07-25 13:26:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:31,217 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:26:31,217 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:26:31,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=9803, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:26:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:26:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:26:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:26:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:26:31,252 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 13:26:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:31,252 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:26:31,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:26:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:26:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:26:31,253 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:31,253 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 13:26:31,253 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2018-07-25 13:26:31,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:31,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:31,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:26:31,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:26:31,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:26:31,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:26:31,606 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2018-07-25 13:26:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:32,557 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:26:32,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:26:32,558 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2018-07-25 13:26:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:32,558 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:26:32,558 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:26:32,559 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:26:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:26:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:26:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:26:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:26:32,590 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 13:26:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:32,591 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:26:32,591 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:26:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:26:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:26:32,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:32,591 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 13:26:32,592 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2018-07-25 13:26:32,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:33,086 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:33,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:26:33,087 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:26:33,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:26:33,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:26:33,088 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2018-07-25 13:26:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:34,096 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:26:34,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:26:34,096 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2018-07-25 13:26:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:34,097 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:26:34,097 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:26:34,098 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=10611, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:26:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:26:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:26:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:26:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:26:34,141 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 13:26:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:34,141 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:26:34,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:26:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:26:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:26:34,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:34,142 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 13:26:34,142 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2018-07-25 13:26:34,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:34,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:34,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:26:34,561 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:26:34,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:26:34,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:26:34,562 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2018-07-25 13:26:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:35,630 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:26:35,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:26:35,630 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2018-07-25 13:26:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:35,631 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:26:35,631 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:26:35,632 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:26:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:26:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:26:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:26:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:26:35,663 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 13:26:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:35,664 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:26:35,664 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:26:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:26:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:26:35,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:35,665 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 13:26:35,665 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2018-07-25 13:26:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:36,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:36,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:26:36,115 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:26:36,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:26:36,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:26:36,115 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2018-07-25 13:26:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:37,180 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:26:37,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:26:37,180 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2018-07-25 13:26:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:37,181 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:26:37,181 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:26:37,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=11451, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:26:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:26:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:26:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:26:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:26:37,215 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 13:26:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:37,215 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:26:37,215 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:26:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:26:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:26:37,216 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:37,216 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 13:26:37,217 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:37,217 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2018-07-25 13:26:37,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:37,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:37,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:26:37,613 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:26:37,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:26:37,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:26:37,614 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2018-07-25 13:26:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:38,844 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:26:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:26:38,844 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2018-07-25 13:26:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:38,845 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:26:38,845 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:26:38,845 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:26:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:26:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:26:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:26:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:26:38,878 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 13:26:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:38,879 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:26:38,879 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:26:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:26:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:26:38,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:38,879 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 13:26:38,879 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2018-07-25 13:26:38,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:39,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:39,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:26:39,366 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:26:39,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:26:39,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:26:39,366 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2018-07-25 13:26:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:40,517 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:26:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:26:40,518 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2018-07-25 13:26:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:40,519 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:26:40,519 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:26:40,520 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=333, Invalid=12323, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:26:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:26:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:26:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:26:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:26:40,563 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 13:26:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:40,563 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:26:40,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:26:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:26:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:26:40,564 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:40,564 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 13:26:40,565 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2018-07-25 13:26:40,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:41,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:41,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:26:41,012 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:26:41,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:26:41,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:26:41,013 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2018-07-25 13:26:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:42,357 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:26:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:26:42,357 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2018-07-25 13:26:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:42,358 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:26:42,358 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:26:42,359 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:26:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:26:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:26:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:26:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:26:42,402 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 13:26:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:42,403 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:26:42,403 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:26:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:26:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:26:42,404 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:42,404 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 13:26:42,404 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2018-07-25 13:26:42,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:42,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:42,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:26:42,963 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:26:42,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:26:42,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:26:42,964 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 61 states. [2018-07-25 13:26:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:44,442 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:26:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:26:44,442 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 116 [2018-07-25 13:26:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:44,443 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:26:44,443 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:26:44,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=13227, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:26:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:26:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:26:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:26:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:26:44,490 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 13:26:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:44,490 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:26:44,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:26:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:26:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:26:44,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:44,491 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 13:26:44,492 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2018-07-25 13:26:44,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:45,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:45,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:26:45,140 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:26:45,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:26:45,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:26:45,140 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 62 states. [2018-07-25 13:26:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:46,515 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:26:46,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:26:46,515 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 118 [2018-07-25 13:26:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:46,516 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:26:46,516 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:26:46,518 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:26:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:26:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:26:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:26:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:26:46,573 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 13:26:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:46,574 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:26:46,574 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:26:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:26:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:26:46,574 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:46,575 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 13:26:46,575 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2018-07-25 13:26:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:47,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:47,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:26:47,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:26:47,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:26:47,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:26:47,103 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 63 states. [2018-07-25 13:26:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:48,534 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:26:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:26:48,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 120 [2018-07-25 13:26:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:48,535 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:26:48,535 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:26:48,536 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=357, Invalid=14163, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:26:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:26:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:26:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:26:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:26:48,580 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 13:26:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:48,580 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:26:48,580 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:26:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:26:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:26:48,581 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:48,581 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 13:26:48,581 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2018-07-25 13:26:48,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:49,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:49,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:26:49,117 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:26:49,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:26:49,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:26:49,118 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 64 states. [2018-07-25 13:26:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:50,562 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:26:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:26:50,563 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 122 [2018-07-25 13:26:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:50,563 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:26:50,564 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:26:50,565 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:26:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:26:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:26:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:26:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:26:50,608 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 13:26:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:50,609 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:26:50,609 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:26:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:26:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:26:50,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:50,610 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 13:26:50,610 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2018-07-25 13:26:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:51,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:51,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:26:51,188 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:26:51,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:26:51,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:26:51,189 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 65 states. [2018-07-25 13:26:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:52,811 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:26:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:26:52,812 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 124 [2018-07-25 13:26:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:52,812 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:26:52,812 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:26:52,813 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=15131, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:26:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:26:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:26:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:26:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:26:52,859 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 13:26:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:52,859 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:26:52,859 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:26:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:26:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:26:52,860 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:52,860 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 13:26:52,860 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2018-07-25 13:26:52,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:53,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:53,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:26:53,445 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:26:53,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:26:53,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:26:53,446 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 66 states. [2018-07-25 13:26:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:54,968 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:26:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:26:54,968 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 126 [2018-07-25 13:26:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:54,969 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:26:54,969 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:26:54,971 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:26:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:26:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:26:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:26:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:26:55,034 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 13:26:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:55,034 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:26:55,034 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:26:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:26:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:26:55,035 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:55,035 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 13:26:55,035 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2018-07-25 13:26:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:55,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:55,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:26:55,634 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:26:55,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:26:55,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:26:55,635 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 67 states. [2018-07-25 13:26:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:57,208 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:26:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:26:57,208 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 128 [2018-07-25 13:26:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:57,209 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:26:57,209 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:26:57,210 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=381, Invalid=16131, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:26:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:26:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:26:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:26:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:26:57,259 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 13:26:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:57,260 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:26:57,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:26:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:26:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:26:57,261 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:57,261 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 13:26:57,262 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2018-07-25 13:26:57,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:58,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:58,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:26:58,160 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:26:58,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:26:58,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:26:58,161 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 68 states. [2018-07-25 13:26:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:59,898 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:26:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:26:59,899 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 130 [2018-07-25 13:26:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:59,899 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:26:59,899 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:26:59,901 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:26:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:26:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:26:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:26:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:26:59,951 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 13:26:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:59,951 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:26:59,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:26:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:26:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:26:59,952 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:59,952 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 13:26:59,953 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2018-07-25 13:26:59,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:00,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:00,585 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:27:00,586 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:27:00,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:27:00,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:27:00,586 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 69 states. [2018-07-25 13:27:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:02,270 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:27:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:27:02,270 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 132 [2018-07-25 13:27:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:02,271 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:27:02,271 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:27:02,272 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=393, Invalid=17163, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:27:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:27:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:27:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:27:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:27:02,325 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 13:27:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:02,326 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:27:02,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:27:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:27:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:27:02,327 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:02,327 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 13:27:02,327 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2018-07-25 13:27:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:03,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:03,028 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:27:03,028 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:27:03,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:27:03,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:27:03,029 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 70 states. [2018-07-25 13:27:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:04,931 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:27:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:27:04,931 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 134 [2018-07-25 13:27:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:04,933 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:27:04,933 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:27:04,934 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:27:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:27:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:27:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:27:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:27:05,010 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 13:27:05,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:05,010 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:27:05,010 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:27:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:27:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:27:05,011 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:05,011 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 13:27:05,011 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2018-07-25 13:27:05,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:06,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:06,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:27:06,078 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:27:06,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:27:06,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:27:06,078 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 71 states. [2018-07-25 13:27:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:08,039 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:27:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:27:08,039 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 136 [2018-07-25 13:27:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:08,040 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:27:08,040 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:27:08,041 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=18227, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:27:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:27:08,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:27:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:27:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:27:08,099 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 13:27:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:08,100 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:27:08,100 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:27:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:27:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:27:08,100 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:08,101 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 13:27:08,101 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2018-07-25 13:27:08,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:08,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:08,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:27:08,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:27:08,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:27:08,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:27:08,849 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 72 states. [2018-07-25 13:27:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:10,870 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:27:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:27:10,871 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 138 [2018-07-25 13:27:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:10,871 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:27:10,872 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:27:10,873 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:27:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:27:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:27:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:27:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:27:10,932 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 13:27:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:10,932 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:27:10,932 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:27:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:27:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:27:10,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:10,933 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 13:27:10,933 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:10,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2018-07-25 13:27:10,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:11,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:11,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:27:11,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:27:11,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:27:11,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:27:11,683 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 73 states. [2018-07-25 13:27:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:13,596 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:27:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:27:13,597 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 140 [2018-07-25 13:27:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:13,597 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:27:13,598 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:27:13,599 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=19323, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:27:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:27:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:27:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:27:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:27:13,675 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 13:27:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:13,675 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:27:13,676 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:27:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:27:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:27:13,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:13,677 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 13:27:13,677 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:13,677 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2018-07-25 13:27:13,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:14,482 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:14,482 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:27:14,483 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:27:14,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:27:14,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:27:14,483 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 74 states. [2018-07-25 13:27:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:16,371 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:27:16,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:27:16,371 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 142 [2018-07-25 13:27:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:16,372 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:27:16,372 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:27:16,373 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:27:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:27:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:27:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:27:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:27:16,462 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 13:27:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:16,462 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:27:16,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:27:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:27:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:27:16,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:16,463 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 13:27:16,464 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:16,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2018-07-25 13:27:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:17,401 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:17,401 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:27:17,402 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:27:17,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:27:17,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:27:17,403 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 75 states. [2018-07-25 13:27:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:19,491 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:27:19,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:27:19,491 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 144 [2018-07-25 13:27:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:19,492 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:27:19,492 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:27:19,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=429, Invalid=20451, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:27:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:27:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:27:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:27:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:27:19,558 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 13:27:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:19,558 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:27:19,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:27:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:27:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:27:19,559 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:19,559 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 13:27:19,559 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2018-07-25 13:27:19,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:20,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:20,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:27:20,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:27:20,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:27:20,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:27:20,278 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 76 states. [2018-07-25 13:27:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:22,233 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:27:22,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:27:22,233 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 146 [2018-07-25 13:27:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:22,234 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:27:22,234 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:27:22,235 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:27:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:27:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:27:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:27:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:27:22,319 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 13:27:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:22,319 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:27:22,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:27:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:27:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:27:22,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:22,321 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 13:27:22,321 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2018-07-25 13:27:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:23,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:23,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:27:23,085 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:27:23,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:27:23,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:27:23,086 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 77 states. [2018-07-25 13:27:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:25,101 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:27:25,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:27:25,101 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 148 [2018-07-25 13:27:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:25,102 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:27:25,102 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:27:25,104 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=441, Invalid=21611, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:27:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:27:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:27:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:27:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:27:25,173 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 13:27:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:25,173 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:27:25,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:27:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:27:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:27:25,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:25,174 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 13:27:25,175 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2018-07-25 13:27:25,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:25,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:25,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:27:25,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:27:25,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:27:25,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:27:25,936 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 78 states. [2018-07-25 13:27:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:28,235 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:27:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:27:28,235 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 150 [2018-07-25 13:27:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:28,236 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:27:28,236 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:27:28,237 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:27:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:27:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:27:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:27:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:27:28,298 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 13:27:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:28,298 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:27:28,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:27:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:27:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:27:28,299 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:28,300 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 13:27:28,300 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2018-07-25 13:27:28,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:29,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:29,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:27:29,129 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:27:29,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:27:29,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:27:29,130 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 79 states. [2018-07-25 13:27:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:31,240 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:27:31,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:27:31,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 152 [2018-07-25 13:27:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:31,241 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:27:31,241 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:27:31,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=453, Invalid=22803, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:27:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:27:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:27:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:27:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:27:31,313 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 13:27:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:31,313 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:27:31,313 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:27:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:27:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:27:31,314 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:31,314 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 13:27:31,314 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2018-07-25 13:27:31,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:32,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:32,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:27:32,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:27:32,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:27:32,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:27:32,324 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 80 states. [2018-07-25 13:27:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:34,539 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:27:34,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:27:34,539 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 154 [2018-07-25 13:27:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:34,539 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:27:34,540 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:27:34,540 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:27:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:27:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:27:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:27:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:27:34,602 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 13:27:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:34,602 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:27:34,602 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:27:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:27:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:27:34,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:34,603 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 13:27:34,603 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:34,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2018-07-25 13:27:34,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:35,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:35,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:27:35,456 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:27:35,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:27:35,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:27:35,457 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 81 states. [2018-07-25 13:27:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:37,670 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:27:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:27:37,670 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 156 [2018-07-25 13:27:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:37,671 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:27:37,671 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:27:37,671 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=24027, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:27:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:27:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:27:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:27:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:27:37,734 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 13:27:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:37,735 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:27:37,735 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:27:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:27:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:27:37,735 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:37,735 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 13:27:37,736 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2018-07-25 13:27:37,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:38,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:38,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:27:38,625 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:27:38,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:27:38,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:27:38,626 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 82 states. [2018-07-25 13:27:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:40,997 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:27:40,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:27:40,997 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2018-07-25 13:27:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:40,998 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:27:40,998 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:27:41,000 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:27:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:27:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:27:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:27:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:27:41,105 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 13:27:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,105 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:27:41,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:27:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:27:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:27:41,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,106 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 13:27:41,106 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2018-07-25 13:27:41,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:42,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:42,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:27:42,108 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:27:42,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:27:42,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:27:42,109 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 83 states. [2018-07-25 13:27:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:44,365 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:27:44,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:27:44,365 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 160 [2018-07-25 13:27:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:44,366 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:27:44,366 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:27:44,367 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=477, Invalid=25283, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:27:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:27:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:27:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:27:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:27:44,437 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 13:27:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:44,438 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:27:44,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:27:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:27:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:27:44,438 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:44,438 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 13:27:44,439 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2018-07-25 13:27:44,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:45,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:45,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:27:45,376 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:27:45,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:27:45,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:27:45,377 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 84 states. [2018-07-25 13:27:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:47,806 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:27:47,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:27:47,806 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 162 [2018-07-25 13:27:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:47,807 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:27:47,807 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:27:47,809 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:27:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:27:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:27:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:27:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:27:47,887 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 13:27:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:47,887 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:27:47,887 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:27:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:27:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:27:47,888 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:47,889 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 13:27:47,889 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2018-07-25 13:27:47,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:48,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:48,890 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:27:48,891 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:27:48,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:27:48,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=6972, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:27:48,892 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 85 states. [2018-07-25 13:27:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:51,477 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:27:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:27:51,477 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 164 [2018-07-25 13:27:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:51,478 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:27:51,478 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:27:51,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=489, Invalid=26571, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:27:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:27:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:27:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:27:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:27:51,561 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 13:27:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:51,561 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:27:51,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:27:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:27:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:27:51,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:51,562 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 13:27:51,562 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2018-07-25 13:27:51,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:52,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:52,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:27:52,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:27:52,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:27:52,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:27:52,644 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 86 states. [2018-07-25 13:27:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:55,324 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:27:55,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:27:55,324 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 166 [2018-07-25 13:27:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:55,325 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:27:55,325 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:27:55,327 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:27:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:27:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:27:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:27:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:27:55,420 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 13:27:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:55,421 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:27:55,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:27:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:27:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:27:55,422 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:55,422 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 13:27:55,422 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2018-07-25 13:27:55,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:56,463 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:56,464 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:27:56,464 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:27:56,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:27:56,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=7310, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:27:56,465 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 87 states. [2018-07-25 13:27:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:59,091 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:27:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:27:59,091 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 168 [2018-07-25 13:27:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:59,092 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:27:59,092 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:27:59,094 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=501, Invalid=27891, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:27:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:27:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:27:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:27:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:27:59,195 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 13:27:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:59,196 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:27:59,196 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:27:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:27:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:27:59,197 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:59,197 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 13:27:59,197 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2018-07-25 13:27:59,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:00,454 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:00,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:28:00,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:28:00,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:28:00,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:28:00,455 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 88 states. [2018-07-25 13:28:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:03,279 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:28:03,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:28:03,279 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 170 [2018-07-25 13:28:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:03,281 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:28:03,281 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:28:03,282 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:28:03,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:28:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:28:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:28:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:28:03,377 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 13:28:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:03,377 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:28:03,378 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:28:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:28:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:28:03,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:03,378 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 13:28:03,379 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2018-07-25 13:28:03,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:04,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:04,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:28:04,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:28:04,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:28:04,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=7656, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:28:04,623 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 89 states. [2018-07-25 13:28:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:07,508 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:28:07,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:28:07,508 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 172 [2018-07-25 13:28:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:07,509 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:28:07,509 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:28:07,510 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=513, Invalid=29243, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:28:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:28:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:28:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:28:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:28:07,598 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 13:28:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:07,598 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:28:07,598 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:28:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:28:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:28:07,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:07,600 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 13:28:07,600 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2018-07-25 13:28:07,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:08,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:08,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:28:08,809 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:28:08,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:28:08,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=7832, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:28:08,810 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 90 states. [2018-07-25 13:28:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:11,623 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:28:11,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:28:11,623 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 174 [2018-07-25 13:28:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:11,624 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:28:11,624 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:28:11,626 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:28:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:28:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:28:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:28:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:28:11,714 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 13:28:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:11,714 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:28:11,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:28:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:28:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:28:11,716 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:11,716 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 13:28:11,716 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:11,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2018-07-25 13:28:11,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:12,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:12,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:28:12,962 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:28:12,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:28:12,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=8010, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:28:12,964 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 91 states. [2018-07-25 13:28:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:15,952 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:28:15,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:28:15,952 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 176 [2018-07-25 13:28:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:15,953 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:28:15,953 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:28:15,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=525, Invalid=30627, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:28:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:28:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:28:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:28:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:28:16,045 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 13:28:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:16,046 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:28:16,046 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:28:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:28:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:28:16,046 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:16,047 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 13:28:16,047 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2018-07-25 13:28:16,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:17,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:17,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:28:17,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:28:17,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:28:17,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:28:17,289 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 92 states. [2018-07-25 13:28:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:20,299 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:28:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:28:20,299 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 178 [2018-07-25 13:28:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:20,300 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:28:20,300 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:28:20,302 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:28:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:28:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:28:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:28:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:28:20,413 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 13:28:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:20,413 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:28:20,413 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:28:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:28:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:28:20,414 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:20,415 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 13:28:20,415 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2018-07-25 13:28:20,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:21,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:21,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:28:21,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:28:21,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:28:21,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=8372, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:28:21,771 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 93 states. [2018-07-25 13:28:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:24,813 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:28:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:28:24,813 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 180 [2018-07-25 13:28:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:24,814 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:28:24,814 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:28:24,816 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=537, Invalid=32043, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:28:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:28:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:28:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:28:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:28:24,914 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 13:28:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:24,914 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:28:24,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:28:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:28:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:28:24,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:24,915 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 13:28:24,916 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2018-07-25 13:28:24,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:26,345 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:26,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:28:26,346 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:28:26,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:28:26,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:28:26,347 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 94 states. [2018-07-25 13:28:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:29,607 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:28:29,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:28:29,607 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 182 [2018-07-25 13:28:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:29,608 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:28:29,608 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:28:29,609 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:28:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:28:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:28:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:28:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:28:29,708 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 13:28:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:29,708 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:28:29,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:28:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:28:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:28:29,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:29,709 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 13:28:29,709 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2018-07-25 13:28:29,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:31,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:31,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:28:31,274 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:28:31,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:28:31,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:28:31,275 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 95 states. [2018-07-25 13:28:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:34,605 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:28:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:28:34,606 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 184 [2018-07-25 13:28:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:34,607 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:28:34,607 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:28:34,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=549, Invalid=33491, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:28:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:28:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:28:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:28:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:28:34,712 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 13:28:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:34,712 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:28:34,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:28:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:28:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:28:34,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:34,713 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 13:28:34,713 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2018-07-25 13:28:34,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:36,228 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:36,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:28:36,229 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:28:36,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:28:36,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=8930, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:28:36,230 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 96 states. [2018-07-25 13:28:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:39,603 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:28:39,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:28:39,603 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 186 [2018-07-25 13:28:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:39,604 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:28:39,604 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:28:39,607 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:28:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:28:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:28:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:28:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:28:39,712 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 13:28:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:39,712 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:28:39,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:28:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:28:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:28:39,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:39,713 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 13:28:39,713 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2018-07-25 13:28:39,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:41,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:41,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:28:41,257 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:28:41,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:28:41,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=9120, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:28:41,258 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 97 states. [2018-07-25 13:28:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:44,517 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:28:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:28:44,518 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 188 [2018-07-25 13:28:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:44,518 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:28:44,518 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:28:44,519 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=34971, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:28:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:28:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:28:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:28:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:28:44,623 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 13:28:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:44,624 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:28:44,624 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:28:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:28:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:28:44,624 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:44,625 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 13:28:44,625 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2018-07-25 13:28:44,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:46,046 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:46,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:28:46,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:28:46,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:28:46,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=9312, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:28:46,047 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 98 states. [2018-07-25 13:28:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:49,491 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:28:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:28:49,491 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 190 [2018-07-25 13:28:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:49,492 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:28:49,493 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:28:49,495 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:28:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:28:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:28:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:28:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:28:49,616 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 13:28:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:49,617 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:28:49,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:28:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:28:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:28:49,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:49,618 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 13:28:49,618 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2018-07-25 13:28:49,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:51,533 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:51,533 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:28:51,533 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:28:51,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:28:51,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=9506, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:28:51,534 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 99 states. [2018-07-25 13:28:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:54,948 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:28:54,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:28:54,949 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 192 [2018-07-25 13:28:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:54,949 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:28:54,950 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:28:54,951 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4465 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=573, Invalid=36483, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:28:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:28:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:28:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:28:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:28:55,050 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 13:28:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:55,050 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:28:55,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:28:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:28:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:28:55,051 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:55,051 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 13:28:55,051 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2018-07-25 13:28:55,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:56,543 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:56,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:28:56,543 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:28:56,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:28:56,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:28:56,544 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 100 states. [2018-07-25 13:29:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,043 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:29:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:29:00,043 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 194 [2018-07-25 13:29:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,044 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:29:00,044 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:29:00,046 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:29:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:29:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:29:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:29:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:29:00,160 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 13:29:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,160 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:29:00,160 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:29:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:29:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:29:00,161 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,161 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 13:29:00,162 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2018-07-25 13:29:00,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:01,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:01,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:29:01,946 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:29:01,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:29:01,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=9900, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:29:01,947 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 101 states. [2018-07-25 13:29:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:05,644 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:29:05,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:29:05,644 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 196 [2018-07-25 13:29:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:05,645 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:29:05,645 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:29:05,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4656 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=585, Invalid=38027, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:29:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:29:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:29:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:29:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:29:05,764 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 13:29:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:05,764 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:29:05,764 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:29:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:29:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:29:05,765 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:05,765 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 13:29:05,765 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2018-07-25 13:29:05,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:07,472 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:07,472 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:29:07,472 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:29:07,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:29:07,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=10100, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:29:07,473 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 102 states. [2018-07-25 13:29:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:11,274 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:29:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:29:11,274 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 198 [2018-07-25 13:29:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:11,275 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:29:11,275 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:29:11,277 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:29:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:29:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:29:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:29:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:29:11,396 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 13:29:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:11,396 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:29:11,396 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:29:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:29:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:29:11,397 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:11,397 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 13:29:11,397 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2018-07-25 13:29:11,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:13,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:13,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:29:13,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:29:13,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:29:13,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=10302, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:29:13,236 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 103 states. [2018-07-25 13:29:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,136 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:29:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:29:17,136 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 200 [2018-07-25 13:29:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,137 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:29:17,137 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:29:17,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=597, Invalid=39603, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:29:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:29:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:29:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:29:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:29:17,293 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 13:29:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,294 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:29:17,294 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:29:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:29:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:29:17,295 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,295 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 13:29:17,295 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2018-07-25 13:29:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:19,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:19,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:29:19,162 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:29:19,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:29:19,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=10506, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:29:19,163 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 104 states. [2018-07-25 13:29:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:23,192 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:29:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:29:23,192 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 202 [2018-07-25 13:29:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:23,193 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:29:23,194 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:29:23,196 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:29:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:29:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:29:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:29:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:29:23,319 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-25 13:29:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:23,319 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:29:23,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:29:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:29:23,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:29:23,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:23,320 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-25 13:29:23,321 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2018-07-25 13:29:23,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:25,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:25,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:29:25,270 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:29:25,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:29:25,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:29:25,271 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 105 states. [2018-07-25 13:29:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:29,296 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:29:29,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:29:29,296 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 204 [2018-07-25 13:29:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:29,297 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:29:29,297 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:29:29,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5050 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=609, Invalid=41211, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:29:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:29:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:29:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:29:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:29:29,457 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-25 13:29:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:29,457 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:29:29,458 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:29:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:29:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:29:29,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:29,458 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-25 13:29:29,459 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash -838117007, now seen corresponding path program 101 times [2018-07-25 13:29:29,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:31,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:31,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:29:31,304 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:29:31,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:29:31,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=10920, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:29:31,305 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 106 states. [2018-07-25 13:29:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:35,461 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 13:29:35,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 13:29:35,461 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 206 [2018-07-25 13:29:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:35,463 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:29:35,463 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:29:35,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5151 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=615, Invalid=42027, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:29:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:29:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:29:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:29:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 13:29:35,594 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-25 13:29:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:35,594 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 13:29:35,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:29:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 13:29:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:29:35,595 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:35,595 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-25 13:29:35,596 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2023340909, now seen corresponding path program 102 times [2018-07-25 13:29:35,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:37,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:29:37,455 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:29:37,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:29:37,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=11130, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:29:37,456 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 107 states. [2018-07-25 13:29:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:41,444 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 13:29:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 13:29:41,444 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 208 [2018-07-25 13:29:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:41,444 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:29:41,444 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:29:41,446 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5253 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=621, Invalid=42851, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:29:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:29:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:29:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:29:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:29:41,563 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-25 13:29:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:41,563 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:29:41,563 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:29:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:29:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:29:41,564 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:41,564 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-25 13:29:41,564 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1189638551, now seen corresponding path program 103 times [2018-07-25 13:29:41,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:43,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:43,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:29:43,456 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:29:43,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:29:43,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=11342, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:29:43,457 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 108 states. [2018-07-25 13:29:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:47,508 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:29:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 13:29:47,508 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 210 [2018-07-25 13:29:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:47,509 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:29:47,509 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:29:47,510 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5356 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=627, Invalid=43683, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:29:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:29:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:29:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:29:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 13:29:47,638 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-25 13:29:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:47,638 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 13:29:47,638 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:29:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 13:29:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:29:47,639 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:47,639 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-25 13:29:47,639 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -781413787, now seen corresponding path program 104 times [2018-07-25 13:29:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:49,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:49,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:29:49,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:29:49,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:29:49,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=11556, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:29:49,492 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 109 states. [2018-07-25 13:29:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:53,895 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 13:29:53,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 13:29:53,895 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 212 [2018-07-25 13:29:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:53,896 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:29:53,896 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:29:53,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5460 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=633, Invalid=44523, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:29:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:29:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:29:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:29:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 13:29:54,033 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-25 13:29:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:54,033 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 13:29:54,033 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:29:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 13:29:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:29:54,034 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:54,034 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-25 13:29:54,034 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:54,034 INFO L82 PathProgramCache]: Analyzing trace with hash 680560481, now seen corresponding path program 105 times [2018-07-25 13:29:54,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 13:29:55,432 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:29:55,437 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:29:55,437 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:55 BoogieIcfgContainer [2018-07-25 13:29:55,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:55,439 INFO L168 Benchmark]: Toolchain (without parser) took 246568.98 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 78.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-25 13:29:55,441 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:55,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:55,441 INFO L168 Benchmark]: Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:55,442 INFO L168 Benchmark]: RCFGBuilder took 246.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:55,442 INFO L168 Benchmark]: TraceAbstraction took 246249.01 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 67.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-25 13:29:55,445 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 246.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246249.01 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 67.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 106, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 63 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 246.1s OverallTime, 106 OverallIterations, 106 TraceHistogramMax, 166.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4372 SDtfs, 1535 SDslu, 294712 SDs, 0 SdLazy, 510700 SolverSat, 5668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11339 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192920 ImplicationChecksByTransitivity, 78.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=105, 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: 5.7s AutomataMinimizationTime, 105 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 8.9s SatisfiabilityAnalysisTime, 59.2s InterpolantComputationTime, 11340 NumberOfCodeBlocks, 11340 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 11235 ConstructedInterpolants, 0 QuantifiedInterpolants, 23527653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 105 InterpolantComputations, 1 PerfectInterpolantSequences, 0/385840 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/jain_5.i_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-29-55-467.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/jain_5.i_2.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-29-55-467.csv Completed graceful shutdown