java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/fragtest_simple.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:15:34,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:15:34,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:15:34,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:15:34,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:15:34,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:15:34,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:15:34,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:15:34,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:15:34,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:15:34,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:15:34,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:15:34,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:15:34,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:15:34,110 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:15:34,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:15:34,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:15:34,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:15:34,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:15:34,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:15:34,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:15:34,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:15:34,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:15:34,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:15:34,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:15:34,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:15:34,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:15:34,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:15:34,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:15:34,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:15:34,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:15:34,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:15:34,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:15:34,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:15:34,132 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:15:34,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:15:34,133 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:15:34,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:15:34,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:15:34,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:15:34,144 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:15:34,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:15:34,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:15:34,145 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:15:34,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:15:34,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:15:34,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:15:34,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:15:34,208 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:15:34,209 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:15:34,210 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl [2018-09-26 08:15:34,210 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl' [2018-09-26 08:15:34,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:15:34,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:15:34,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:15:34,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:15:34,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:15:34,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:15:34,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:15:34,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:15:34,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:15:34,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:15:34,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:15:34,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:15:34,335 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:15:34,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/1) ... [2018-09-26 08:15:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:15:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:15:34,604 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:15:34,605 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:15:34 BoogieIcfgContainer [2018-09-26 08:15:34,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:15:34,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:15:34,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:15:34,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:15:34,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:34" (1/2) ... [2018-09-26 08:15:34,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74dd58b1 and model type fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:15:34, skipping insertion in model container [2018-09-26 08:15:34,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:15:34" (2/2) ... [2018-09-26 08:15:34,617 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bpl [2018-09-26 08:15:34,627 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:15:34,635 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:15:34,683 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:15:34,684 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:15:34,684 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:15:34,684 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:15:34,684 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:15:34,685 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:15:34,685 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:15:34,685 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:15:34,685 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:15:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 08:15:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:15:34,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:34,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:15:34,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:34,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash 889599113, now seen corresponding path program 1 times [2018-09-26 08:15:34,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:34,820 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:15:34,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:15:34,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:15:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:15:34,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:15:34,846 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-09-26 08:15:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:34,920 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-09-26 08:15:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:15:34,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:15:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:34,933 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:15:34,934 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:15:34,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:15:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:15:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-26 08:15:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:15:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:15:34,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-26 08:15:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:34,981 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:15:34,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:15:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:15:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:15:34,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:34,984 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:15:34,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:34,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:34,985 INFO L82 PathProgramCache]: Analyzing trace with hash 206308035, now seen corresponding path program 1 times [2018-09-26 08:15:34,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,028 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:15:35,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:15:35,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:15:35,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:15:35,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:15:35,032 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-09-26 08:15:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,075 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-09-26 08:15:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:15:35,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-26 08:15:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,077 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:15:35,077 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:15:35,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:15:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:15:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:15:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:15:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:15:35,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-26 08:15:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,083 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:15:35,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:15:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:15:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:15:35,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,084 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:15:35,084 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1531170369, now seen corresponding path program 1 times [2018-09-26 08:15:35,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:15:35,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:15:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:15:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:15:35,147 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-09-26 08:15:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,245 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-09-26 08:15:35,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:15:35,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:15:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,246 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:15:35,246 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:15:35,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:15:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:15:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:15:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:15:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:15:35,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-26 08:15:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,254 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:15:35,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:15:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:15:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:15:35,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,257 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:15:35,257 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1719110265, now seen corresponding path program 2 times [2018-09-26 08:15:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:15:35,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:15:35,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:15:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:15:35,315 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-26 08:15:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,355 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-09-26 08:15:35,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:15:35,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-26 08:15:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,357 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:15:35,357 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:15:35,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:15:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:15:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:15:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:15:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:15:35,369 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-26 08:15:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,369 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:15:35,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:15:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:15:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:15:35,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,371 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-26 08:15:35,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,372 INFO L82 PathProgramCache]: Analyzing trace with hash -587211915, now seen corresponding path program 3 times [2018-09-26 08:15:35,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:15:35,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:15:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:15:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:15:35,463 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-09-26 08:15:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,508 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-09-26 08:15:35,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:15:35,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-09-26 08:15:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,509 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:15:35,512 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:15:35,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:15:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:15:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:15:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:15:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-26 08:15:35,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-26 08:15:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,529 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-26 08:15:35,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:15:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-26 08:15:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:15:35,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,530 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-26 08:15:35,531 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1669882193, now seen corresponding path program 4 times [2018-09-26 08:15:35,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:15:35,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:15:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:15:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:15:35,614 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2018-09-26 08:15:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,676 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-09-26 08:15:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:15:35,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:15:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,680 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:15:35,680 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:15:35,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:15:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:15:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:15:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:15:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:15:35,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-26 08:15:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,688 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:15:35,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:15:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:15:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:15:35,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,690 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-26 08:15:35,691 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash 70717867, now seen corresponding path program 5 times [2018-09-26 08:15:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:15:35,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:15:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:15:35,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:15:35,769 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2018-09-26 08:15:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,829 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-09-26 08:15:35,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:15:35,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:15:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,831 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:15:35,832 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:15:35,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:15:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:15:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:15:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:15:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-26 08:15:35,840 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-09-26 08:15:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,841 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-26 08:15:35,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:15:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-26 08:15:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:15:35,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,842 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-09-26 08:15:35,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2045097383, now seen corresponding path program 6 times [2018-09-26 08:15:35,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:15:35,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:15:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:15:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:15:35,887 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2018-09-26 08:15:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,946 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-09-26 08:15:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:15:35,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-09-26 08:15:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,947 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:15:35,947 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:15:35,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:15:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:15:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:15:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:15:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 08:15:35,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2018-09-26 08:15:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,955 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 08:15:35,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:15:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 08:15:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:15:35,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,957 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-26 08:15:35,957 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,957 INFO L82 PathProgramCache]: Analyzing trace with hash 37022875, now seen corresponding path program 7 times [2018-09-26 08:15:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:36,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:36,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:15:36,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:15:36,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:15:36,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:15:36,014 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2018-09-26 08:15:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,062 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-09-26 08:15:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:15:36,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-09-26 08:15:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,064 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:15:36,064 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:15:36,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:15:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:15:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:15:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:15:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:15:36,074 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-26 08:15:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,076 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:15:36,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:15:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:15:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:15:36,080 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,081 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-26 08:15:36,081 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1480612969, now seen corresponding path program 8 times [2018-09-26 08:15:36,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:36,169 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:36,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:15:36,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:15:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:15:36,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:15:36,171 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-09-26 08:15:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,212 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-26 08:15:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:15:36,213 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-09-26 08:15:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,214 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:15:36,214 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:15:36,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:15:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:15:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:15:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:15:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-26 08:15:36,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-26 08:15:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,223 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-26 08:15:36,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:15:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-26 08:15:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:15:36,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,224 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-26 08:15:36,225 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash 360221587, now seen corresponding path program 9 times [2018-09-26 08:15:36,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:36,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:36,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:15:36,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:15:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:15:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:15:36,281 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2018-09-26 08:15:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,349 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-09-26 08:15:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:15:36,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-09-26 08:15:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,350 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:15:36,350 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:15:36,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:15:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:15:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:15:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:15:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-09-26 08:15:36,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-09-26 08:15:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,368 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-09-26 08:15:36,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:15:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-09-26 08:15:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:15:36,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,371 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2018-09-26 08:15:36,372 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1263725703, now seen corresponding path program 10 times [2018-09-26 08:15:36,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:36,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:36,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:15:36,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:15:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:15:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:15:36,461 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2018-09-26 08:15:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,530 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-09-26 08:15:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:15:36,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-09-26 08:15:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,534 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:15:36,534 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:15:36,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:15:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:15:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:15:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:15:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 08:15:36,548 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-09-26 08:15:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,549 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 08:15:36,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:15:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 08:15:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:15:36,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,553 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-26 08:15:36,553 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1629808515, now seen corresponding path program 11 times [2018-09-26 08:15:36,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:36,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:36,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:15:36,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:15:36,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:15:36,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:15:36,645 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2018-09-26 08:15:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,721 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-09-26 08:15:36,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:15:36,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-09-26 08:15:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,722 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:15:36,722 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:15:36,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:15:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:15:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:15:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:15:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-09-26 08:15:36,732 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-09-26 08:15:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,735 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-09-26 08:15:36,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:15:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-09-26 08:15:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:15:36,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,740 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2018-09-26 08:15:36,740 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1248072575, now seen corresponding path program 12 times [2018-09-26 08:15:36,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:36,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:36,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:15:36,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:15:36,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:15:36,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:15:36,823 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-09-26 08:15:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,906 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-26 08:15:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:15:36,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-09-26 08:15:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,907 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:15:36,907 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:15:36,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:15:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:15:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:15:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:15:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-26 08:15:36,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2018-09-26 08:15:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,919 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-26 08:15:36,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:15:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-26 08:15:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:15:36,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,920 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-26 08:15:36,921 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1910464909, now seen corresponding path program 13 times [2018-09-26 08:15:36,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:37,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:37,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:15:37,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:15:37,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:15:37,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:15:37,031 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2018-09-26 08:15:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:37,102 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-09-26 08:15:37,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:15:37,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-09-26 08:15:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:37,103 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:15:37,103 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:15:37,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:15:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:15:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:15:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:15:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:15:37,122 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-26 08:15:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:37,122 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:15:37,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:15:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:15:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:15:37,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:37,126 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-26 08:15:37,126 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:37,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash 179690863, now seen corresponding path program 14 times [2018-09-26 08:15:37,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:37,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:37,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:15:37,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:15:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:15:37,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:15:37,224 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2018-09-26 08:15:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:37,301 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-26 08:15:37,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:15:37,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-09-26 08:15:37,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:37,302 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:15:37,302 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:15:37,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:15:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:15:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:15:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:15:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-26 08:15:37,316 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-26 08:15:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:37,316 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-26 08:15:37,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:15:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-26 08:15:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:15:37,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:37,319 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-26 08:15:37,319 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:37,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:37,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1225306773, now seen corresponding path program 15 times [2018-09-26 08:15:37,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:37,397 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:37,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:15:37,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:15:37,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:15:37,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:15:37,399 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-09-26 08:15:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:37,475 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-09-26 08:15:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:15:37,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-09-26 08:15:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:37,476 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:15:37,476 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:15:37,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:15:37,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:15:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:15:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:15:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-09-26 08:15:37,486 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-09-26 08:15:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:37,487 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-09-26 08:15:37,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:15:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-09-26 08:15:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:15:37,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:37,488 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2018-09-26 08:15:37,492 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:37,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1452473761, now seen corresponding path program 16 times [2018-09-26 08:15:37,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:37,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:37,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:15:37,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:15:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:15:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:15:37,609 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 24 states. [2018-09-26 08:15:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:37,707 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-09-26 08:15:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:15:37,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-09-26 08:15:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:37,709 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:15:37,710 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:15:37,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:15:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:15:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:15:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:15:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:15:37,725 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-09-26 08:15:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:37,725 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:15:37,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:15:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:15:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:15:37,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:37,729 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-26 08:15:37,729 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:37,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1195476315, now seen corresponding path program 17 times [2018-09-26 08:15:37,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:37,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:37,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:15:37,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:15:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:15:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:15:37,862 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 25 states. [2018-09-26 08:15:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:37,953 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-09-26 08:15:37,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:15:37,953 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-09-26 08:15:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:37,954 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:15:37,954 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:15:37,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:15:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:15:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:15:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:15:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-09-26 08:15:37,965 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-09-26 08:15:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:37,966 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-09-26 08:15:37,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:15:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-09-26 08:15:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:15:37,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:37,967 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2018-09-26 08:15:37,973 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:37,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1040107177, now seen corresponding path program 18 times [2018-09-26 08:15:37,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:38,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:38,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:15:38,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:15:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:15:38,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:15:38,076 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 17 states. [2018-09-26 08:15:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:38,164 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-09-26 08:15:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:15:38,164 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-09-26 08:15:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:38,165 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:15:38,165 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:15:38,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:15:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:15:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:15:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:15:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-26 08:15:38,175 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2018-09-26 08:15:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:38,175 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-26 08:15:38,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:15:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-26 08:15:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:15:38,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:38,177 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1] [2018-09-26 08:15:38,177 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:38,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash 75962443, now seen corresponding path program 19 times [2018-09-26 08:15:38,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:38,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:38,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:15:38,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:15:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:15:38,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:15:38,304 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 28 states. [2018-09-26 08:15:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:38,397 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-09-26 08:15:38,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:15:38,397 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-09-26 08:15:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:38,398 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:15:38,398 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:15:38,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=455, Invalid=1105, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:15:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:15:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:15:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:15:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 08:15:38,415 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-09-26 08:15:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:38,416 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 08:15:38,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:15:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 08:15:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:15:38,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:38,417 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-26 08:15:38,417 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:38,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1108795207, now seen corresponding path program 20 times [2018-09-26 08:15:38,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:38,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:38,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:15:38,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:15:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:15:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:15:38,560 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 29 states. [2018-09-26 08:15:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:38,665 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-26 08:15:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:15:38,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-09-26 08:15:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:38,666 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:15:38,666 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:15:38,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:15:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:15:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:15:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:15:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-26 08:15:38,680 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-26 08:15:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:38,680 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-26 08:15:38,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:15:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-26 08:15:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:15:38,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:38,682 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-26 08:15:38,682 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:38,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:38,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1523636035, now seen corresponding path program 21 times [2018-09-26 08:15:38,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:38,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:38,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:15:38,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:15:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:15:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:15:38,857 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 19 states. [2018-09-26 08:15:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:38,944 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-26 08:15:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:15:38,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-09-26 08:15:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:38,945 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:15:38,945 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:15:38,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:15:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:15:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:15:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:15:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-09-26 08:15:38,961 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2018-09-26 08:15:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:38,962 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-09-26 08:15:38,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:15:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-09-26 08:15:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:15:38,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:38,963 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1] [2018-09-26 08:15:38,963 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:38,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1329455159, now seen corresponding path program 22 times [2018-09-26 08:15:38,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:39,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:39,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:15:39,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:15:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:15:39,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:15:39,109 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 32 states. [2018-09-26 08:15:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:39,233 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-09-26 08:15:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:15:39,233 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-09-26 08:15:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:39,234 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:15:39,234 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:15:39,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=600, Invalid=1470, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:15:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:15:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:15:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:15:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:15:39,245 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-09-26 08:15:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:39,245 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:15:39,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:15:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:15:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:15:39,246 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:39,246 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-26 08:15:39,247 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:39,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1862593331, now seen corresponding path program 23 times [2018-09-26 08:15:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:39,397 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:39,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:15:39,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:15:39,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:15:39,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:15:39,399 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 33 states. [2018-09-26 08:15:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:39,532 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-09-26 08:15:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:15:39,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-09-26 08:15:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:39,533 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:15:39,533 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:15:39,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=663, Invalid=1593, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:15:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:15:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:15:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:15:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-09-26 08:15:39,546 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-09-26 08:15:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:39,546 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-09-26 08:15:39,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:15:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-09-26 08:15:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:15:39,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:39,547 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1] [2018-09-26 08:15:39,548 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:39,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1187698897, now seen corresponding path program 24 times [2018-09-26 08:15:39,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:39,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:39,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:15:39,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:15:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:15:39,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:15:39,652 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 21 states. [2018-09-26 08:15:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:39,747 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-09-26 08:15:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:15:39,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-09-26 08:15:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:39,748 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:15:39,748 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:15:39,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:15:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:15:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:15:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:15:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-09-26 08:15:39,757 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2018-09-26 08:15:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:39,757 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-09-26 08:15:39,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:15:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-09-26 08:15:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:15:39,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:39,758 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1] [2018-09-26 08:15:39,758 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:39,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1105222179, now seen corresponding path program 25 times [2018-09-26 08:15:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:39,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:39,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:15:39,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:15:39,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:15:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:15:39,907 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 36 states. [2018-09-26 08:15:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:40,008 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-09-26 08:15:40,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:15:40,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-09-26 08:15:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:40,009 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:15:40,010 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:15:40,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=765, Invalid=1887, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:15:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:15:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:15:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:15:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:15:40,019 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-09-26 08:15:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:40,019 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:15:40,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:15:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:15:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:15:40,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:40,020 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-26 08:15:40,021 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:40,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:40,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1247455519, now seen corresponding path program 26 times [2018-09-26 08:15:40,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:40,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:40,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:15:40,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:15:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:15:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:15:40,185 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 37 states. [2018-09-26 08:15:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:40,309 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-26 08:15:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:15:40,309 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-09-26 08:15:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:40,310 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:15:40,310 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:15:40,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=836, Invalid=2026, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:15:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:15:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:15:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:15:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-26 08:15:40,320 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-26 08:15:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:40,320 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-26 08:15:40,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:15:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-26 08:15:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:15:40,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:40,321 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-26 08:15:40,322 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:40,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash 494741787, now seen corresponding path program 27 times [2018-09-26 08:15:40,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:40,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:40,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:15:40,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:15:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:15:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:15:40,433 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 23 states. [2018-09-26 08:15:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:40,532 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-09-26 08:15:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:15:40,532 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2018-09-26 08:15:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:40,533 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:15:40,533 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:15:40,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:15:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:15:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:15:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:15:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-26 08:15:40,543 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2018-09-26 08:15:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:40,543 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-26 08:15:40,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:15:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-26 08:15:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:15:40,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:40,545 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-26 08:15:40,545 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:40,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:40,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1564313103, now seen corresponding path program 28 times [2018-09-26 08:15:40,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:40,717 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:40,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:15:40,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:15:40,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:15:40,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:15:40,719 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 40 states. [2018-09-26 08:15:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:40,855 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-09-26 08:15:40,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:15:40,856 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2018-09-26 08:15:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:40,857 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:15:40,857 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:15:40,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=950, Invalid=2356, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:15:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:15:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:15:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:15:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 08:15:40,867 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-26 08:15:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:40,868 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 08:15:40,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:15:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 08:15:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:15:40,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:40,869 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-26 08:15:40,869 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:40,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 417798411, now seen corresponding path program 29 times [2018-09-26 08:15:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:41,061 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:41,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:15:41,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:15:41,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:15:41,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:15:41,063 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 41 states. [2018-09-26 08:15:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:41,230 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-09-26 08:15:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:15:41,230 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2018-09-26 08:15:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:41,231 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:15:41,232 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:15:41,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1029, Invalid=2511, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:15:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:15:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:15:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:15:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-09-26 08:15:41,246 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-09-26 08:15:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:41,246 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-09-26 08:15:41,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:15:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-09-26 08:15:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:15:41,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:41,248 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1] [2018-09-26 08:15:41,248 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:41,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1871192825, now seen corresponding path program 30 times [2018-09-26 08:15:41,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:41,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:41,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:15:41,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:15:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:15:41,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:15:41,421 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 25 states. [2018-09-26 08:15:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:41,534 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-26 08:15:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:15:41,535 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-09-26 08:15:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:41,536 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:15:41,536 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:15:41,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:15:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:15:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:15:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:15:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-09-26 08:15:41,549 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-09-26 08:15:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:41,549 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-09-26 08:15:41,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:15:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-09-26 08:15:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:15:41,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:41,551 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1] [2018-09-26 08:15:41,551 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:41,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1432067077, now seen corresponding path program 31 times [2018-09-26 08:15:41,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:41,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:41,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:15:41,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:15:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:15:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:15:41,760 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 44 states. [2018-09-26 08:15:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:41,921 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-09-26 08:15:41,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:15:41,922 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2018-09-26 08:15:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:41,923 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:15:41,923 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:15:41,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1155, Invalid=2877, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:15:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:15:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:15:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:15:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:15:41,935 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-09-26 08:15:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:41,936 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:15:41,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:15:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:15:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:15:41,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:41,937 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-26 08:15:41,937 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:41,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:41,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1476838665, now seen corresponding path program 32 times [2018-09-26 08:15:41,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:42,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:42,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:15:42,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:15:42,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:15:42,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:15:42,138 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 45 states. [2018-09-26 08:15:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:42,296 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-26 08:15:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:15:42,296 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2018-09-26 08:15:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:42,297 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:15:42,297 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:15:42,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1242, Invalid=3048, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:15:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:15:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:15:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:15:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-26 08:15:42,310 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-26 08:15:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:42,310 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-26 08:15:42,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:15:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-26 08:15:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:15:42,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:42,311 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-26 08:15:42,312 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:42,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1552661773, now seen corresponding path program 33 times [2018-09-26 08:15:42,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:42,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:42,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:15:42,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:15:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:15:42,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:15:42,438 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 27 states. [2018-09-26 08:15:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:42,556 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-09-26 08:15:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:15:42,556 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 92 [2018-09-26 08:15:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:42,557 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:15:42,557 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:15:42,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=926, Invalid=1524, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:15:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:15:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:15:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:15:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-26 08:15:42,570 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2018-09-26 08:15:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:42,570 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-26 08:15:42,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:15:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-26 08:15:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:15:42,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:42,571 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-26 08:15:42,572 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:42,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2078536679, now seen corresponding path program 34 times [2018-09-26 08:15:42,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:42,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:42,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:15:42,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:15:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:15:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:15:42,807 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 48 states. [2018-09-26 08:15:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:43,009 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-09-26 08:15:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:15:43,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2018-09-26 08:15:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:43,010 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:15:43,010 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:15:43,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1380, Invalid=3450, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:15:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:15:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:15:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:15:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:15:43,026 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-26 08:15:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:43,027 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:15:43,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:15:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:15:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:15:43,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:43,028 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-26 08:15:43,028 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:43,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash 224399075, now seen corresponding path program 35 times [2018-09-26 08:15:43,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:43,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:43,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:15:43,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:15:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:15:43,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:15:43,271 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 49 states. [2018-09-26 08:15:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:43,459 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-09-26 08:15:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:15:43,459 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2018-09-26 08:15:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:43,460 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:15:43,460 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:15:43,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1475, Invalid=3637, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:15:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:15:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:15:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:15:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-09-26 08:15:43,473 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-09-26 08:15:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:43,473 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-09-26 08:15:43,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:15:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-09-26 08:15:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:15:43,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:43,475 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1] [2018-09-26 08:15:43,475 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:43,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:43,475 INFO L82 PathProgramCache]: Analyzing trace with hash 809589471, now seen corresponding path program 36 times [2018-09-26 08:15:43,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:43,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:43,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:15:43,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:15:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:15:43,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:15:43,617 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 29 states. [2018-09-26 08:15:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:43,764 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-09-26 08:15:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:15:43,765 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2018-09-26 08:15:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:43,766 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:15:43,766 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:15:43,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1781, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:15:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:15:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:15:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:15:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-09-26 08:15:43,788 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2018-09-26 08:15:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:43,788 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-09-26 08:15:43,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:15:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-09-26 08:15:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:15:43,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:43,790 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1] [2018-09-26 08:15:43,790 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:43,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash 726349267, now seen corresponding path program 37 times [2018-09-26 08:15:43,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:44,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:44,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:15:44,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:15:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:15:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:15:44,085 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 52 states. [2018-09-26 08:15:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:44,317 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-09-26 08:15:44,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:15:44,317 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2018-09-26 08:15:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:44,318 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:15:44,349 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:15:44,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1625, Invalid=4075, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:15:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:15:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:15:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:15:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 08:15:44,381 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-09-26 08:15:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:44,381 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 08:15:44,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:15:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 08:15:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:15:44,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:44,383 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-26 08:15:44,383 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:44,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1735038159, now seen corresponding path program 38 times [2018-09-26 08:15:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:44,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:44,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:15:44,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:15:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:15:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:15:44,604 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 53 states. [2018-09-26 08:15:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:44,809 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-26 08:15:44,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:15:44,809 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2018-09-26 08:15:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:44,810 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:15:44,810 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:15:44,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1728, Invalid=4278, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:15:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:15:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:15:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:15:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-26 08:15:44,824 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-26 08:15:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:44,825 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-26 08:15:44,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:15:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-26 08:15:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:15:44,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:44,826 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-26 08:15:44,826 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:44,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash 422454475, now seen corresponding path program 39 times [2018-09-26 08:15:44,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:44,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:44,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:15:44,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:15:44,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:15:44,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:15:44,971 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 31 states. [2018-09-26 08:15:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:45,103 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-26 08:15:45,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:15:45,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 108 [2018-09-26 08:15:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:45,105 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:15:45,105 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:15:45,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1248, Invalid=2058, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:15:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:15:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:15:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:15:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-26 08:15:45,119 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 108 [2018-09-26 08:15:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-26 08:15:45,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:15:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-26 08:15:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:15:45,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:45,120 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-26 08:15:45,121 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:45,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -609670721, now seen corresponding path program 40 times [2018-09-26 08:15:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:45,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:45,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:15:45,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:15:45,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:15:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:15:45,368 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 56 states. [2018-09-26 08:15:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:45,578 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-09-26 08:15:45,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:15:45,579 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2018-09-26 08:15:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:45,580 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:15:45,580 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:15:45,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1890, Invalid=4752, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:15:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:15:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:15:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:15:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:15:45,596 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-26 08:15:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:45,597 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:15:45,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:15:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:15:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:15:45,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:45,598 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-26 08:15:45,598 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:45,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1662530373, now seen corresponding path program 41 times [2018-09-26 08:15:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:45,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:45,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:15:45,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:15:45,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:15:45,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:15:45,864 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 57 states. [2018-09-26 08:15:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:46,110 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2018-09-26 08:15:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:15:46,110 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 114 [2018-09-26 08:15:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:46,111 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:15:46,111 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:15:46,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2001, Invalid=4971, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:15:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:15:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:15:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:15:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-09-26 08:15:46,131 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-09-26 08:15:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:46,131 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-09-26 08:15:46,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:15:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-09-26 08:15:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:15:46,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:46,133 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1] [2018-09-26 08:15:46,133 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:46,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 151625911, now seen corresponding path program 42 times [2018-09-26 08:15:46,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:46,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:46,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:15:46,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:15:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:15:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:15:46,291 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 33 states. [2018-09-26 08:15:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:46,443 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-09-26 08:15:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:15:46,443 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 116 [2018-09-26 08:15:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:46,444 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:15:46,444 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:15:46,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1427, Invalid=2355, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:15:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:15:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:15:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:15:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-09-26 08:15:46,461 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2018-09-26 08:15:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:46,461 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-09-26 08:15:46,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:15:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-09-26 08:15:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:15:46,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:46,462 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1] [2018-09-26 08:15:46,463 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:46,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:46,463 INFO L82 PathProgramCache]: Analyzing trace with hash 944557995, now seen corresponding path program 43 times [2018-09-26 08:15:46,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:46,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:46,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:15:46,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:15:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:15:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:15:46,745 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 60 states. [2018-09-26 08:15:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:47,002 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-09-26 08:15:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:15:47,002 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2018-09-26 08:15:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:47,003 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:15:47,003 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:15:47,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2175, Invalid=5481, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:15:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:15:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:15:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:15:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:15:47,024 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-09-26 08:15:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:47,024 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:15:47,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:15:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:15:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:15:47,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:47,026 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-26 08:15:47,026 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:47,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 489076391, now seen corresponding path program 44 times [2018-09-26 08:15:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:47,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:47,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:15:47,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:15:47,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:15:47,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:15:47,408 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 61 states. [2018-09-26 08:15:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:47,662 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-09-26 08:15:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:15:47,662 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 122 [2018-09-26 08:15:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:47,663 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:15:47,663 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:15:47,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2294, Invalid=5716, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:15:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:15:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:15:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:15:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-09-26 08:15:47,680 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-09-26 08:15:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:47,680 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-09-26 08:15:47,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:15:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-09-26 08:15:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:15:47,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:47,682 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1] [2018-09-26 08:15:47,682 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:47,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 857919139, now seen corresponding path program 45 times [2018-09-26 08:15:47,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:47,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:47,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:15:47,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:15:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:15:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:15:47,853 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 35 states. [2018-09-26 08:15:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:48,019 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-09-26 08:15:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:15:48,020 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 124 [2018-09-26 08:15:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:48,021 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:15:48,021 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:15:48,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1618, Invalid=2672, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:15:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:15:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:15:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:15:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-26 08:15:48,038 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-09-26 08:15:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:48,039 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-26 08:15:48,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:15:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-26 08:15:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:15:48,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:48,040 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-26 08:15:48,041 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:48,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:48,041 INFO L82 PathProgramCache]: Analyzing trace with hash 889530263, now seen corresponding path program 46 times [2018-09-26 08:15:48,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:48,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:48,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:15:48,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:15:48,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:15:48,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:15:48,323 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 64 states. [2018-09-26 08:15:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:48,599 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-09-26 08:15:48,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:15:48,599 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2018-09-26 08:15:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:48,600 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:15:48,600 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:15:48,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2480, Invalid=6262, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:15:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:15:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:15:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:15:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 08:15:48,620 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-26 08:15:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:48,620 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 08:15:48,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:15:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 08:15:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:15:48,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:48,622 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-26 08:15:48,622 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:48,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:48,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1611246957, now seen corresponding path program 47 times [2018-09-26 08:15:48,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:48,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:48,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:15:48,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:15:48,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:15:48,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:15:48,908 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 65 states. [2018-09-26 08:15:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:49,191 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-26 08:15:49,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:15:49,191 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 130 [2018-09-26 08:15:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:49,192 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:15:49,192 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:15:49,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2607, Invalid=6513, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:15:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:15:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:15:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:15:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-26 08:15:49,213 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-26 08:15:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:49,214 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-26 08:15:49,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:15:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-26 08:15:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:15:49,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:49,215 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-26 08:15:49,216 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:49,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash 323530383, now seen corresponding path program 48 times [2018-09-26 08:15:49,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:49,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:49,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:15:49,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:15:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:15:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:15:49,422 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 37 states. [2018-09-26 08:15:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:49,601 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-26 08:15:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:15:49,601 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 132 [2018-09-26 08:15:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:49,602 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:15:49,602 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:15:49,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1821, Invalid=3009, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:15:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:15:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:15:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:15:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-09-26 08:15:49,621 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-09-26 08:15:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:49,621 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-09-26 08:15:49,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:15:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-09-26 08:15:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:15:49,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:49,623 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1] [2018-09-26 08:15:49,623 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:49,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -836685437, now seen corresponding path program 49 times [2018-09-26 08:15:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:49,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:49,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:15:49,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:15:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:15:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:15:49,949 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 68 states. [2018-09-26 08:15:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:50,244 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-09-26 08:15:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:15:50,244 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2018-09-26 08:15:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:50,245 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:15:50,246 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:15:50,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2805, Invalid=7095, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:15:50,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:15:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:15:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:15:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:15:50,310 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-09-26 08:15:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:50,310 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:15:50,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:15:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:15:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:15:50,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:50,312 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-26 08:15:50,313 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:50,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash -442130305, now seen corresponding path program 50 times [2018-09-26 08:15:50,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:50,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:50,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:15:50,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:15:50,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:15:50,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:15:50,634 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 69 states. [2018-09-26 08:15:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:50,945 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-26 08:15:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:15:50,946 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 138 [2018-09-26 08:15:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:50,947 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:15:50,948 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:15:50,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2940, Invalid=7362, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:15:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:15:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:15:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:15:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-26 08:15:50,968 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-26 08:15:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:50,969 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-26 08:15:50,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:15:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-26 08:15:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:15:50,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:50,970 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-26 08:15:50,971 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:50,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash 768229499, now seen corresponding path program 51 times [2018-09-26 08:15:50,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:51,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:51,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:15:51,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:15:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:15:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:15:51,186 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 39 states. [2018-09-26 08:15:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:51,368 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-09-26 08:15:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:15:51,369 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 140 [2018-09-26 08:15:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:51,371 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:15:51,371 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:15:51,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2036, Invalid=3366, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:15:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:15:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:15:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:15:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-26 08:15:51,391 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2018-09-26 08:15:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:51,392 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-26 08:15:51,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:15:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-26 08:15:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:15:51,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:51,397 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-09-26 08:15:51,397 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:51,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash -932188817, now seen corresponding path program 52 times [2018-09-26 08:15:51,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:51,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:51,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:15:51,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:15:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:15:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:15:51,757 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 72 states. [2018-09-26 08:15:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:52,082 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-09-26 08:15:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:15:52,082 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2018-09-26 08:15:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:52,084 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:15:52,084 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:15:52,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3150, Invalid=7980, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:15:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:15:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:15:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:15:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:15:52,103 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-09-26 08:15:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:52,103 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:15:52,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:15:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:15:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:15:52,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:52,105 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-09-26 08:15:52,105 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:52,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1996726379, now seen corresponding path program 53 times [2018-09-26 08:15:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:52,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:52,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:15:52,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:15:52,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:15:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:15:52,453 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 73 states. [2018-09-26 08:15:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:52,786 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-09-26 08:15:52,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:15:52,786 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 146 [2018-09-26 08:15:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:52,787 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:15:52,787 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:15:52,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3293, Invalid=8263, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:15:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:15:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:15:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:15:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-09-26 08:15:52,807 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-09-26 08:15:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:52,808 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-09-26 08:15:52,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:15:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-09-26 08:15:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:15:52,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:52,810 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1] [2018-09-26 08:15:52,810 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:52,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:52,810 INFO L82 PathProgramCache]: Analyzing trace with hash -814316441, now seen corresponding path program 54 times [2018-09-26 08:15:52,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:53,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:53,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:15:53,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:15:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:15:53,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:15:53,038 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 41 states. [2018-09-26 08:15:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:53,264 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-09-26 08:15:53,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:15:53,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 148 [2018-09-26 08:15:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:53,265 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:15:53,266 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:15:53,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2263, Invalid=3743, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:15:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:15:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:15:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:15:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-09-26 08:15:53,285 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 148 [2018-09-26 08:15:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:53,285 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-09-26 08:15:53,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:15:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-09-26 08:15:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:15:53,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:53,289 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1] [2018-09-26 08:15:53,289 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:53,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:53,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1900043099, now seen corresponding path program 55 times [2018-09-26 08:15:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:53,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:53,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:15:53,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:15:53,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:15:53,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:15:53,800 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 76 states. [2018-09-26 08:15:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:54,103 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-09-26 08:15:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:15:54,104 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2018-09-26 08:15:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:54,107 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:15:54,107 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:15:54,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3515, Invalid=8917, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:15:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:15:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:15:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:15:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-26 08:15:54,126 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-09-26 08:15:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:54,126 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-26 08:15:54,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:15:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-26 08:15:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:15:54,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:54,128 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-09-26 08:15:54,128 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:54,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:54,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1700745815, now seen corresponding path program 56 times [2018-09-26 08:15:54,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:54,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:54,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:15:54,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:15:54,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:15:54,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:15:54,471 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 77 states. [2018-09-26 08:15:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:54,753 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-09-26 08:15:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:15:54,753 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 154 [2018-09-26 08:15:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:54,754 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:15:54,754 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:15:54,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3666, Invalid=9216, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:15:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:15:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:15:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:15:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-09-26 08:15:54,772 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-09-26 08:15:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:54,772 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-09-26 08:15:54,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:15:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-09-26 08:15:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:15:54,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:54,774 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1] [2018-09-26 08:15:54,774 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:54,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash -845383085, now seen corresponding path program 57 times [2018-09-26 08:15:54,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:54,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:54,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:15:54,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:15:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:15:54,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:15:54,991 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 43 states. [2018-09-26 08:15:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:55,171 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-26 08:15:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:15:55,171 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 156 [2018-09-26 08:15:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:55,173 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:15:55,173 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:15:55,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2502, Invalid=4140, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:15:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:15:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:15:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:15:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-09-26 08:15:55,189 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 156 [2018-09-26 08:15:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:55,189 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-09-26 08:15:55,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:15:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-09-26 08:15:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:15:55,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:55,191 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2018-09-26 08:15:55,191 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:55,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1583446855, now seen corresponding path program 58 times [2018-09-26 08:15:55,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:55,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:55,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:15:55,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:15:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:15:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:15:55,580 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 80 states. [2018-09-26 08:15:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:55,945 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-09-26 08:15:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:15:55,946 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2018-09-26 08:15:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:55,947 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:15:55,947 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:15:55,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3900, Invalid=9906, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:15:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:15:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:15:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:15:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:15:55,969 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-09-26 08:15:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:55,969 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:15:55,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:15:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:15:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:15:55,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:55,972 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-09-26 08:15:55,972 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:55,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:55,972 INFO L82 PathProgramCache]: Analyzing trace with hash 176666179, now seen corresponding path program 59 times [2018-09-26 08:15:55,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:56,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:56,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:15:56,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:15:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:15:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:15:56,344 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 81 states. [2018-09-26 08:15:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:56,713 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-09-26 08:15:56,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:15:56,713 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 162 [2018-09-26 08:15:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:56,717 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:15:56,717 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:15:56,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4059, Invalid=10221, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:15:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:15:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:15:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:15:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-09-26 08:15:56,744 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-09-26 08:15:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:56,745 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-09-26 08:15:56,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:15:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-09-26 08:15:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:15:56,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:56,747 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2018-09-26 08:15:56,747 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:56,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1175134783, now seen corresponding path program 60 times [2018-09-26 08:15:56,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:56,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:56,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:15:56,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:15:56,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:15:56,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:15:56,959 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 45 states. [2018-09-26 08:15:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:57,145 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-09-26 08:15:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:15:57,145 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 164 [2018-09-26 08:15:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:57,146 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:15:57,147 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:15:57,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2753, Invalid=4557, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:15:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:15:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:15:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:15:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-09-26 08:15:57,164 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-09-26 08:15:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:57,164 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-09-26 08:15:57,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:15:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-09-26 08:15:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:15:57,166 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:57,166 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1] [2018-09-26 08:15:57,167 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:57,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash 773999923, now seen corresponding path program 61 times [2018-09-26 08:15:57,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:57,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:57,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:15:57,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:15:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:15:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:15:57,575 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 84 states. [2018-09-26 08:15:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:57,930 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-09-26 08:15:57,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:15:57,930 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2018-09-26 08:15:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:57,931 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:15:57,935 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:15:57,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4305, Invalid=10947, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:15:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:15:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:15:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:15:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:15:57,958 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-09-26 08:15:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:57,959 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:15:57,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:15:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:15:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:15:57,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:57,961 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-09-26 08:15:57,961 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:57,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash -926168017, now seen corresponding path program 62 times [2018-09-26 08:15:57,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:58,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:58,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:15:58,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:15:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:15:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:15:58,366 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 85 states. [2018-09-26 08:15:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:58,734 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-09-26 08:15:58,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:15:58,734 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2018-09-26 08:15:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:58,736 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:15:58,736 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:15:58,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4472, Invalid=11278, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:15:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:15:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:15:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:15:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-09-26 08:15:58,754 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-09-26 08:15:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:58,754 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-09-26 08:15:58,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:15:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-09-26 08:15:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:15:58,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:58,756 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1] [2018-09-26 08:15:58,757 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:58,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1594981419, now seen corresponding path program 63 times [2018-09-26 08:15:58,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:58,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:58,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:15:58,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:15:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:15:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:15:58,983 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 47 states. [2018-09-26 08:15:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:59,191 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-09-26 08:15:59,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:15:59,191 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 172 [2018-09-26 08:15:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:59,192 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:15:59,192 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:15:59,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3016, Invalid=4994, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:15:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:15:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:15:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:15:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-09-26 08:15:59,210 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 172 [2018-09-26 08:15:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:59,211 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-09-26 08:15:59,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:15:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-09-26 08:15:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:15:59,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:59,213 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2018-09-26 08:15:59,213 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:59,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:59,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1196544287, now seen corresponding path program 64 times [2018-09-26 08:15:59,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:59,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:59,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:15:59,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:15:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:15:59,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:15:59,726 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 88 states. [2018-09-26 08:16:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:00,215 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2018-09-26 08:16:00,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:16:00,215 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2018-09-26 08:16:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:00,217 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:16:00,217 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:16:00,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4730, Invalid=12040, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:16:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:16:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:16:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:16:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-26 08:16:00,241 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-09-26 08:16:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:00,242 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-26 08:16:00,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:16:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-26 08:16:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:16:00,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:00,244 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-09-26 08:16:00,245 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:00,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:00,245 INFO L82 PathProgramCache]: Analyzing trace with hash -889547749, now seen corresponding path program 65 times [2018-09-26 08:16:00,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:00,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:00,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:16:00,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:16:00,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:16:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:16:00,735 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 89 states. [2018-09-26 08:16:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:01,114 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2018-09-26 08:16:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:16:01,114 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 178 [2018-09-26 08:16:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:01,119 INFO L225 Difference]: With dead ends: 271 [2018-09-26 08:16:01,119 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:16:01,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2710 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4905, Invalid=12387, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:16:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:16:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:16:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:16:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-09-26 08:16:01,149 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-09-26 08:16:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:01,149 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-09-26 08:16:01,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:16:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-09-26 08:16:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:16:01,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:01,151 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1] [2018-09-26 08:16:01,151 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:01,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:01,152 INFO L82 PathProgramCache]: Analyzing trace with hash 125732887, now seen corresponding path program 66 times [2018-09-26 08:16:01,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:01,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:01,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:16:01,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:16:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:16:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:16:01,396 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 49 states. [2018-09-26 08:16:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:01,602 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-09-26 08:16:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:16:01,603 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 180 [2018-09-26 08:16:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:01,604 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:16:01,604 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:16:01,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3291, Invalid=5451, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:16:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:16:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:16:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:16:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-09-26 08:16:01,625 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 180 [2018-09-26 08:16:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:01,626 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-09-26 08:16:01,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:16:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-09-26 08:16:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:16:01,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:01,628 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 1, 1, 1, 1] [2018-09-26 08:16:01,628 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:01,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:01,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922677, now seen corresponding path program 67 times [2018-09-26 08:16:01,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:02,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:02,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:16:02,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:16:02,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:16:02,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:16:02,038 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 92 states. [2018-09-26 08:16:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:02,508 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-09-26 08:16:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:16:02,509 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 184 [2018-09-26 08:16:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:02,510 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:16:02,510 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:16:02,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5175, Invalid=13185, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:16:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:16:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:16:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:16:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:16:02,532 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-09-26 08:16:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:02,532 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:16:02,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:16:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:16:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:16:02,534 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:02,534 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-09-26 08:16:02,535 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:02,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1000141305, now seen corresponding path program 68 times [2018-09-26 08:16:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:03,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:03,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:16:03,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:16:03,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:16:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:16:03,025 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 93 states. [2018-09-26 08:16:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:03,468 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-09-26 08:16:03,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:16:03,468 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 186 [2018-09-26 08:16:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:03,470 INFO L225 Difference]: With dead ends: 283 [2018-09-26 08:16:03,470 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:16:03,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5358, Invalid=13548, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:16:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:16:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:16:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:16:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-09-26 08:16:03,492 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-09-26 08:16:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:03,493 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-09-26 08:16:03,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:16:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-09-26 08:16:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:16:03,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:03,495 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 45, 1, 1, 1, 1] [2018-09-26 08:16:03,495 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:03,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1230944765, now seen corresponding path program 69 times [2018-09-26 08:16:03,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:03,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:03,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:16:03,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:16:03,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:16:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:16:03,859 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 51 states. [2018-09-26 08:16:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:04,068 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-09-26 08:16:04,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:16:04,069 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 188 [2018-09-26 08:16:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:04,070 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:16:04,070 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:16:04,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3578, Invalid=5928, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:16:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:16:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:16:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:16:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-09-26 08:16:04,089 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2018-09-26 08:16:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:04,090 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-09-26 08:16:04,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:16:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-09-26 08:16:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:16:04,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:04,095 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 46, 1, 1, 1, 1] [2018-09-26 08:16:04,096 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:04,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1538846455, now seen corresponding path program 70 times [2018-09-26 08:16:04,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:04,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:04,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:16:04,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:16:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:16:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:16:04,476 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 96 states. [2018-09-26 08:16:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:04,847 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-09-26 08:16:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:16:04,847 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 192 [2018-09-26 08:16:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:04,848 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:16:04,849 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:16:04,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5640, Invalid=14382, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:16:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:16:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:16:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:16:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:16:04,872 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-09-26 08:16:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:04,873 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:16:04,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:16:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:16:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:16:04,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:04,874 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-09-26 08:16:04,874 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:04,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1328268813, now seen corresponding path program 71 times [2018-09-26 08:16:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:16:05,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:16:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:16:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:16:05,228 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 97 states. [2018-09-26 08:16:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,536 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-09-26 08:16:05,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:16:05,536 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 194 [2018-09-26 08:16:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,538 INFO L225 Difference]: With dead ends: 295 [2018-09-26 08:16:05,538 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:16:05,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5831, Invalid=14761, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:16:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:16:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:16:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:16:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-09-26 08:16:05,555 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-09-26 08:16:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,555 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-09-26 08:16:05,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:16:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-09-26 08:16:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:16:05,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,557 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2018-09-26 08:16:05,557 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash 742962671, now seen corresponding path program 72 times [2018-09-26 08:16:05,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:16:05,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:16:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:16:05,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:16:05,767 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 53 states. [2018-09-26 08:16:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,993 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2018-09-26 08:16:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:16:05,993 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 196 [2018-09-26 08:16:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,994 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:16:05,994 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:16:05,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3877, Invalid=6425, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:16:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:16:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:16:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:16:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-09-26 08:16:06,010 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 196 [2018-09-26 08:16:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,010 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-09-26 08:16:06,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:16:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-09-26 08:16:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:16:06,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,011 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2018-09-26 08:16:06,012 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash -821131037, now seen corresponding path program 73 times [2018-09-26 08:16:06,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,373 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:16:06,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:16:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:16:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:16:06,375 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 100 states. [2018-09-26 08:16:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,822 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-09-26 08:16:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:16:06,822 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 200 [2018-09-26 08:16:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,824 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:16:06,824 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:16:06,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6125, Invalid=15631, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:16:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:16:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:16:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:16:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-26 08:16:06,845 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-09-26 08:16:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,846 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-26 08:16:06,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:16:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-26 08:16:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:16:06,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,847 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-09-26 08:16:06,847 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1801644065, now seen corresponding path program 74 times [2018-09-26 08:16:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:16:07,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:16:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:16:07,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:16:07,248 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 101 states. [2018-09-26 08:16:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,612 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-09-26 08:16:07,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:16:07,613 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 202 [2018-09-26 08:16:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,614 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:16:07,614 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:16:07,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3529 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6324, Invalid=16026, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:16:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:16:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:16:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:16:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-09-26 08:16:07,631 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-09-26 08:16:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,631 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-09-26 08:16:07,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:16:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-09-26 08:16:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:16:07,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,633 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 49, 1, 1, 1, 1] [2018-09-26 08:16:07,633 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 818141147, now seen corresponding path program 75 times [2018-09-26 08:16:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:16:07,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:16:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:16:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:16:07,827 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 55 states. [2018-09-26 08:16:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,980 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-26 08:16:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:16:07,981 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-09-26 08:16:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,982 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:16:07,982 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:16:07,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2601 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4188, Invalid=6942, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:16:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:16:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:16:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:16:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-09-26 08:16:08,008 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-09-26 08:16:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:08,012 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-09-26 08:16:08,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:16:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-09-26 08:16:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:16:08,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:08,013 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 50, 1, 1, 1, 1] [2018-09-26 08:16:08,014 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:08,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -66136881, now seen corresponding path program 76 times [2018-09-26 08:16:08,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:08,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:08,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:16:08,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:16:08,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:16:08,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:16:08,431 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 104 states. [2018-09-26 08:16:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:08,867 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-09-26 08:16:08,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:16:08,867 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 208 [2018-09-26 08:16:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:08,868 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:16:08,869 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:16:08,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6630, Invalid=16932, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:16:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:16:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:16:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:16:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:16:08,893 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-09-26 08:16:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:08,893 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:16:08,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:16:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:16:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:16:08,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:08,894 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-09-26 08:16:08,895 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:08,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1015850955, now seen corresponding path program 77 times [2018-09-26 08:16:08,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:09,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:09,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:16:09,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:16:09,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:16:09,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:16:09,313 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 105 states. [2018-09-26 08:16:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:09,764 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-09-26 08:16:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:16:09,764 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 210 [2018-09-26 08:16:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:09,766 INFO L225 Difference]: With dead ends: 319 [2018-09-26 08:16:09,766 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:16:09,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3826 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6837, Invalid=17343, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:16:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:16:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:16:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:16:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-09-26 08:16:09,788 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-09-26 08:16:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:09,789 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-09-26 08:16:09,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:16:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-09-26 08:16:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:16:09,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:09,790 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2018-09-26 08:16:09,790 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:09,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1424075719, now seen corresponding path program 78 times [2018-09-26 08:16:09,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:10,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:10,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:16:10,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:16:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:16:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:16:10,035 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 57 states. [2018-09-26 08:16:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:10,203 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2018-09-26 08:16:10,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:16:10,204 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 212 [2018-09-26 08:16:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:10,205 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:16:10,205 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:16:10,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4511, Invalid=7479, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:16:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:16:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:16:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:16:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-09-26 08:16:10,222 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 212 [2018-09-26 08:16:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:10,223 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-09-26 08:16:10,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:16:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-09-26 08:16:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:16:10,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:10,224 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2018-09-26 08:16:10,224 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:10,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1946735291, now seen corresponding path program 79 times [2018-09-26 08:16:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:10,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:10,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:16:10,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:16:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:16:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:16:10,631 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 108 states. [2018-09-26 08:16:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:11,063 INFO L93 Difference]: Finished difference Result 329 states and 331 transitions. [2018-09-26 08:16:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:16:11,064 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 216 [2018-09-26 08:16:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:11,065 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:16:11,065 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:16:11,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7155, Invalid=18285, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:16:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:16:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:16:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:16:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:16:11,083 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-09-26 08:16:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:11,083 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:16:11,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:16:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:16:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:16:11,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:11,085 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-09-26 08:16:11,085 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:11,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash -34477641, now seen corresponding path program 80 times [2018-09-26 08:16:11,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:11,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:11,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:16:11,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:16:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:16:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:16:11,505 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 109 states. [2018-09-26 08:16:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:11,889 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-09-26 08:16:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:16:11,889 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 218 [2018-09-26 08:16:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:11,890 INFO L225 Difference]: With dead ends: 331 [2018-09-26 08:16:11,890 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:16:11,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7370, Invalid=18712, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:16:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:16:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:16:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:16:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-09-26 08:16:11,915 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-09-26 08:16:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:11,915 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-09-26 08:16:11,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:16:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-09-26 08:16:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:16:11,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:11,917 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 53, 1, 1, 1, 1] [2018-09-26 08:16:11,917 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:11,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1309593165, now seen corresponding path program 81 times [2018-09-26 08:16:11,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:12,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:12,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:16:12,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:16:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:16:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:16:12,254 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 59 states. [2018-09-26 08:16:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:12,471 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-09-26 08:16:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:16:12,471 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 220 [2018-09-26 08:16:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:12,473 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:16:12,473 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:16:12,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4846, Invalid=8036, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:16:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:16:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:16:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:16:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-09-26 08:16:12,500 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 220 [2018-09-26 08:16:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:12,500 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-09-26 08:16:12,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:16:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-09-26 08:16:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:16:12,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:12,502 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 54, 1, 1, 1, 1] [2018-09-26 08:16:12,502 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:12,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash 281772711, now seen corresponding path program 82 times [2018-09-26 08:16:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:13,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:13,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:16:13,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:16:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:16:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:16:13,054 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 112 states. [2018-09-26 08:16:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:13,461 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2018-09-26 08:16:13,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:16:13,461 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 224 [2018-09-26 08:16:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:13,463 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:16:13,463 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:16:13,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7700, Invalid=19690, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:16:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:16:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:16:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:16:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-09-26 08:16:13,489 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-09-26 08:16:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:13,489 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-09-26 08:16:13,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:16:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-09-26 08:16:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:16:13,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:13,491 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-09-26 08:16:13,491 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:13,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:13,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1989926307, now seen corresponding path program 83 times [2018-09-26 08:16:13,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:16:14,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:16:14,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:16:14,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:16:14,125 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 113 states. [2018-09-26 08:16:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,567 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2018-09-26 08:16:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:16:14,568 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 226 [2018-09-26 08:16:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,569 INFO L225 Difference]: With dead ends: 343 [2018-09-26 08:16:14,569 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:16:14,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4456 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7923, Invalid=20133, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:16:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:16:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:16:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:16:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-09-26 08:16:14,588 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-09-26 08:16:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,588 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-09-26 08:16:14,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:16:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-09-26 08:16:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:16:14,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,590 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 55, 1, 1, 1, 1] [2018-09-26 08:16:14,592 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1446942305, now seen corresponding path program 84 times [2018-09-26 08:16:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:16:14,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:16:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:16:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:16:14,853 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 61 states. [2018-09-26 08:16:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,047 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-09-26 08:16:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:16:15,048 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 228 [2018-09-26 08:16:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,049 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:16:15,049 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:16:15,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5193, Invalid=8613, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:16:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:16:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:16:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:16:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-09-26 08:16:15,070 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-09-26 08:16:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,071 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-09-26 08:16:15,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:16:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-09-26 08:16:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:16:15,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,072 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 56, 1, 1, 1, 1] [2018-09-26 08:16:15,072 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1264196461, now seen corresponding path program 85 times [2018-09-26 08:16:15,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:16:15,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:16:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:16:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:16:15,544 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 116 states. [2018-09-26 08:16:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,056 INFO L93 Difference]: Finished difference Result 353 states and 355 transitions. [2018-09-26 08:16:16,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:16:16,056 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 232 [2018-09-26 08:16:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,058 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:16:16,058 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:16:16,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8265, Invalid=21147, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:16:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:16:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:16:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:16:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:16:16,083 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-09-26 08:16:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,084 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:16:16,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:16:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:16:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:16:16,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,085 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-09-26 08:16:16,085 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1289323407, now seen corresponding path program 86 times [2018-09-26 08:16:16,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:16:16,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:16:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:16:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:16:16,573 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 117 states. [2018-09-26 08:16:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:17,045 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-09-26 08:16:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:16:17,045 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 234 [2018-09-26 08:16:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:17,046 INFO L225 Difference]: With dead ends: 355 [2018-09-26 08:16:17,047 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:16:17,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4789 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8496, Invalid=21606, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:16:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:16:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:16:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:16:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-09-26 08:16:17,063 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-09-26 08:16:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:17,063 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-09-26 08:16:17,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:16:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-09-26 08:16:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:16:17,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:17,064 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 57, 1, 1, 1, 1] [2018-09-26 08:16:17,064 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:17,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1499376757, now seen corresponding path program 87 times [2018-09-26 08:16:17,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:17,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:17,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:16:17,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:16:17,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:16:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:16:17,323 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 63 states. [2018-09-26 08:16:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:17,512 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-09-26 08:16:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:16:17,512 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 236 [2018-09-26 08:16:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:17,513 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:16:17,514 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:16:17,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5552, Invalid=9210, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:16:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:16:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:16:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:16:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-09-26 08:16:17,538 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 236 [2018-09-26 08:16:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:17,539 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-09-26 08:16:17,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:16:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-09-26 08:16:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:16:17,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:17,540 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 58, 1, 1, 1, 1] [2018-09-26 08:16:17,541 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:17,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 174520447, now seen corresponding path program 88 times [2018-09-26 08:16:17,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:18,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:18,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:16:18,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:16:18,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:16:18,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:16:18,042 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 120 states. [2018-09-26 08:16:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:18,534 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2018-09-26 08:16:18,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:16:18,535 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 240 [2018-09-26 08:16:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:18,536 INFO L225 Difference]: With dead ends: 365 [2018-09-26 08:16:18,536 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:16:18,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5075 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8850, Invalid=22656, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:16:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:16:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:16:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:16:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-09-26 08:16:18,557 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-09-26 08:16:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:18,557 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-09-26 08:16:18,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:16:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-09-26 08:16:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:16:18,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:18,558 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-09-26 08:16:18,558 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:18,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash -277226629, now seen corresponding path program 89 times [2018-09-26 08:16:18,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:19,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:19,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:16:19,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:16:19,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:16:19,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:16:19,129 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 121 states. [2018-09-26 08:16:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:19,843 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-09-26 08:16:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:16:19,843 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 242 [2018-09-26 08:16:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:19,844 INFO L225 Difference]: With dead ends: 367 [2018-09-26 08:16:19,845 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:16:19,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9089, Invalid=23131, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:16:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:16:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:16:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:16:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-09-26 08:16:19,879 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-09-26 08:16:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:19,880 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-09-26 08:16:19,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:16:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-09-26 08:16:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:16:19,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:19,882 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 59, 1, 1, 1, 1] [2018-09-26 08:16:19,882 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:19,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash -614469769, now seen corresponding path program 90 times [2018-09-26 08:16:19,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:20,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:20,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:16:20,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:16:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:16:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:16:20,235 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 65 states. [2018-09-26 08:16:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:20,463 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2018-09-26 08:16:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:16:20,463 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 244 [2018-09-26 08:16:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:20,465 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:16:20,465 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:16:20,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3721 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5923, Invalid=9827, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:16:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:16:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-09-26 08:16:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:16:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-09-26 08:16:20,493 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-09-26 08:16:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:20,493 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-09-26 08:16:20,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:16:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-09-26 08:16:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:16:20,494 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:20,495 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 60, 1, 1, 1, 1] [2018-09-26 08:16:20,495 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:20,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1163771499, now seen corresponding path program 91 times [2018-09-26 08:16:20,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:21,076 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:21,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:16:21,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:16:21,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:16:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:16:21,078 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 124 states. [2018-09-26 08:16:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:21,571 INFO L93 Difference]: Finished difference Result 377 states and 379 transitions. [2018-09-26 08:16:21,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:16:21,571 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 248 [2018-09-26 08:16:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:21,572 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:16:21,572 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:16:21,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9455, Invalid=24217, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:16:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:16:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:16:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:16:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-09-26 08:16:21,590 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-09-26 08:16:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:21,590 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-09-26 08:16:21,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:16:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-09-26 08:16:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:16:21,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:21,591 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-09-26 08:16:21,592 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:21,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1439425895, now seen corresponding path program 92 times [2018-09-26 08:16:21,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:22,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:22,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:16:22,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:16:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:16:22,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:16:22,082 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 125 states. [2018-09-26 08:16:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:22,517 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-09-26 08:16:22,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:16:22,518 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 250 [2018-09-26 08:16:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:22,519 INFO L225 Difference]: With dead ends: 379 [2018-09-26 08:16:22,519 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:16:22,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5491 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9702, Invalid=24708, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:16:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:16:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-09-26 08:16:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:16:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-09-26 08:16:22,540 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-09-26 08:16:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:22,540 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-09-26 08:16:22,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:16:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-09-26 08:16:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:16:22,541 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:22,541 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 61, 1, 1, 1, 1] [2018-09-26 08:16:22,541 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:22,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash 55328099, now seen corresponding path program 93 times [2018-09-26 08:16:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:22,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:22,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:16:22,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:16:22,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:16:22,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:16:22,844 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 67 states. [2018-09-26 08:16:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:23,071 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-09-26 08:16:23,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:16:23,071 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 252 [2018-09-26 08:16:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:23,072 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:16:23,073 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:16:23,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3969 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6306, Invalid=10464, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:16:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:16:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-09-26 08:16:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:16:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-09-26 08:16:23,097 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 252 [2018-09-26 08:16:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:23,097 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-09-26 08:16:23,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:16:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-09-26 08:16:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:16:23,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:23,099 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 62, 1, 1, 1, 1] [2018-09-26 08:16:23,099 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:23,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash -514247081, now seen corresponding path program 94 times [2018-09-26 08:16:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:23,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:23,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:16:23,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:16:23,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:16:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:16:23,770 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 128 states. [2018-09-26 08:16:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:24,252 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2018-09-26 08:16:24,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:16:24,252 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 256 [2018-09-26 08:16:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:24,253 INFO L225 Difference]: With dead ends: 389 [2018-09-26 08:16:24,254 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:16:24,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5797 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10080, Invalid=25830, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:16:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:16:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:16:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:16:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-09-26 08:16:24,274 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-09-26 08:16:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:24,274 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-09-26 08:16:24,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:16:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-09-26 08:16:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:16:24,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:24,276 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-09-26 08:16:24,276 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:24,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1080123053, now seen corresponding path program 95 times [2018-09-26 08:16:24,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:24,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:24,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:16:24,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:16:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:16:24,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:16:24,904 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 129 states. [2018-09-26 08:16:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:25,427 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-09-26 08:16:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:16:25,427 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 258 [2018-09-26 08:16:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:25,428 INFO L225 Difference]: With dead ends: 391 [2018-09-26 08:16:25,428 INFO L226 Difference]: Without dead ends: 261 [2018-09-26 08:16:25,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5860 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10335, Invalid=26337, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:16:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-09-26 08:16:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-09-26 08:16:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:16:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-09-26 08:16:25,450 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-09-26 08:16:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:25,451 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-09-26 08:16:25,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:16:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-09-26 08:16:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:16:25,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:25,452 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 63, 1, 1, 1, 1] [2018-09-26 08:16:25,452 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:25,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash 573914447, now seen corresponding path program 96 times [2018-09-26 08:16:25,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4160 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:25,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:25,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:16:25,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:16:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:16:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:16:25,792 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 69 states. [2018-09-26 08:16:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,021 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-09-26 08:16:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:16:26,021 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 260 [2018-09-26 08:16:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,023 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:16:26,023 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 08:16:26,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6701, Invalid=11121, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:16:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 08:16:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-09-26 08:16:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:16:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-09-26 08:16:26,044 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 260 [2018-09-26 08:16:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,044 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-09-26 08:16:26,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:16:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-09-26 08:16:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:16:26,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,045 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 64, 1, 1, 1, 1] [2018-09-26 08:16:26,045 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1655201859, now seen corresponding path program 97 times [2018-09-26 08:16:26,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:26,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:26,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:16:26,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:16:26,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:16:26,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4421, Invalid=12871, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:16:26,645 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 132 states. [2018-09-26 08:16:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,326 INFO L93 Difference]: Finished difference Result 401 states and 403 transitions. [2018-09-26 08:16:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:16:27,326 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 264 [2018-09-26 08:16:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,327 INFO L225 Difference]: With dead ends: 401 [2018-09-26 08:16:27,327 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:16:27,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10725, Invalid=27495, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:16:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:16:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-09-26 08:16:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:16:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-09-26 08:16:27,356 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-09-26 08:16:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,356 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-09-26 08:16:27,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:16:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-09-26 08:16:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:16:27,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,358 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-09-26 08:16:27,358 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1967198015, now seen corresponding path program 98 times [2018-09-26 08:16:27,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:16:27,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:16:27,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:16:27,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:16:27,973 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 133 states. [2018-09-26 08:16:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,476 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-09-26 08:16:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:16:28,476 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 266 [2018-09-26 08:16:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,478 INFO L225 Difference]: With dead ends: 403 [2018-09-26 08:16:28,478 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:16:28,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10988, Invalid=28018, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:16:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:16:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-09-26 08:16:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:16:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-09-26 08:16:28,499 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-09-26 08:16:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:28,499 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-09-26 08:16:28,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:16:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-09-26 08:16:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:16:28,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:28,501 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 65, 1, 1, 1, 1] [2018-09-26 08:16:28,501 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:28,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1147793211, now seen corresponding path program 99 times [2018-09-26 08:16:28,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4422 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:28,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:28,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:16:28,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:16:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:16:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:16:28,964 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 71 states. [2018-09-26 08:16:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:29,206 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2018-09-26 08:16:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:16:29,207 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 268 [2018-09-26 08:16:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:29,208 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:16:29,208 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:16:29,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4489 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7108, Invalid=11798, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:16:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:16:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-09-26 08:16:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:16:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-09-26 08:16:29,238 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 268 [2018-09-26 08:16:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:29,239 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-09-26 08:16:29,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:16:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-09-26 08:16:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 08:16:29,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:29,240 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 66, 1, 1, 1, 1] [2018-09-26 08:16:29,241 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:29,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash 370818095, now seen corresponding path program 100 times [2018-09-26 08:16:29,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:30,010 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:30,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:16:30,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:16:30,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:16:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=13669, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:16:30,013 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 136 states. [2018-09-26 08:16:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:30,537 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2018-09-26 08:16:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:16:30,538 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 272 [2018-09-26 08:16:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:30,539 INFO L225 Difference]: With dead ends: 413 [2018-09-26 08:16:30,539 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:16:30,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6567 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11390, Invalid=29212, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:16:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:16:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-09-26 08:16:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:16:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-09-26 08:16:30,564 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-09-26 08:16:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:30,564 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-09-26 08:16:30,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:16:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-09-26 08:16:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:16:30,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:30,566 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-09-26 08:16:30,566 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:30,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2021511381, now seen corresponding path program 101 times [2018-09-26 08:16:30,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:31,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:31,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:16:31,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:16:31,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:16:31,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:16:31,247 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 137 states. [2018-09-26 08:16:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:31,763 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2018-09-26 08:16:31,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:16:31,763 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 274 [2018-09-26 08:16:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:31,764 INFO L225 Difference]: With dead ends: 415 [2018-09-26 08:16:31,764 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:16:31,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6634 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11661, Invalid=29751, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:16:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:16:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-26 08:16:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 08:16:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-09-26 08:16:31,794 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-09-26 08:16:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:31,794 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-09-26 08:16:31,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:16:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-09-26 08:16:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 08:16:31,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:31,796 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 67, 1, 1, 1, 1] [2018-09-26 08:16:31,796 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:31,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1052332839, now seen corresponding path program 102 times [2018-09-26 08:16:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4692 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:32,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:32,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:16:32,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:16:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:16:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:16:32,204 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 73 states. [2018-09-26 08:16:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:32,447 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-09-26 08:16:32,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:16:32,448 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 276 [2018-09-26 08:16:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:32,448 INFO L225 Difference]: With dead ends: 283 [2018-09-26 08:16:32,448 INFO L226 Difference]: Without dead ends: 281 [2018-09-26 08:16:32,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4761 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7527, Invalid=12495, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:16:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-26 08:16:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-09-26 08:16:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:16:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-09-26 08:16:32,472 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 276 [2018-09-26 08:16:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:32,472 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-09-26 08:16:32,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:16:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-09-26 08:16:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:16:32,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:32,474 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 68, 1, 1, 1, 1] [2018-09-26 08:16:32,474 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:32,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:32,475 INFO L82 PathProgramCache]: Analyzing trace with hash -788674021, now seen corresponding path program 103 times [2018-09-26 08:16:32,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:33,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:33,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:16:33,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:16:33,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:16:33,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4969, Invalid=14491, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:16:33,199 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 140 states. [2018-09-26 08:16:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:33,728 INFO L93 Difference]: Finished difference Result 425 states and 427 transitions. [2018-09-26 08:16:33,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:16:33,729 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 280 [2018-09-26 08:16:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:33,729 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:16:33,730 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:16:33,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6970 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12075, Invalid=30981, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:16:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:16:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-09-26 08:16:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:16:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-09-26 08:16:33,752 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-09-26 08:16:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:33,753 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-09-26 08:16:33,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:16:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-09-26 08:16:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:16:33,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:33,754 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-09-26 08:16:33,754 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:33,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1884225257, now seen corresponding path program 104 times [2018-09-26 08:16:33,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:34,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:34,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:16:34,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:16:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:16:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:16:34,439 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 141 states. [2018-09-26 08:16:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:35,115 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-09-26 08:16:35,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:16:35,115 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 282 [2018-09-26 08:16:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:35,116 INFO L225 Difference]: With dead ends: 427 [2018-09-26 08:16:35,116 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 08:16:35,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7039 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12354, Invalid=31536, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:16:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 08:16:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-09-26 08:16:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:16:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-09-26 08:16:35,146 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-09-26 08:16:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:35,146 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-09-26 08:16:35,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:16:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-09-26 08:16:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 08:16:35,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:35,148 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 69, 1, 1, 1, 1] [2018-09-26 08:16:35,148 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:35,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:35,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1852991763, now seen corresponding path program 105 times [2018-09-26 08:16:35,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4970 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:35,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:35,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:16:35,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:16:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:16:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:16:35,586 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 75 states. [2018-09-26 08:16:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:35,848 INFO L93 Difference]: Finished difference Result 291 states and 293 transitions. [2018-09-26 08:16:35,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:16:35,848 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 284 [2018-09-26 08:16:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:35,849 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:16:35,849 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:16:35,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7958, Invalid=13212, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:16:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:16:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-09-26 08:16:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 08:16:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-09-26 08:16:35,871 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-09-26 08:16:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:35,871 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-09-26 08:16:35,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:16:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-09-26 08:16:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 08:16:35,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:35,873 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 70, 1, 1, 1, 1] [2018-09-26 08:16:35,873 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:35,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1323169273, now seen corresponding path program 106 times [2018-09-26 08:16:35,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10082 backedges. 5112 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:36,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:36,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:16:36,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:16:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:16:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=15337, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:16:36,574 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 144 states. [2018-09-26 08:16:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:37,270 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2018-09-26 08:16:37,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:16:37,270 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 288 [2018-09-26 08:16:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:37,270 INFO L225 Difference]: With dead ends: 437 [2018-09-26 08:16:37,271 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:16:37,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7385 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12780, Invalid=32802, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:16:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:16:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-09-26 08:16:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:16:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-09-26 08:16:37,300 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 288 [2018-09-26 08:16:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:37,300 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-09-26 08:16:37,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:16:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-09-26 08:16:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:16:37,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:37,301 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-09-26 08:16:37,301 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:37,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1872528643, now seen corresponding path program 107 times [2018-09-26 08:16:37,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 5112 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:38,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:38,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:16:38,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:16:38,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:16:38,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:16:38,114 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 145 states. [2018-09-26 08:16:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:38,748 INFO L93 Difference]: Finished difference Result 439 states and 441 transitions. [2018-09-26 08:16:38,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:16:38,749 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 290 [2018-09-26 08:16:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:38,749 INFO L225 Difference]: With dead ends: 439 [2018-09-26 08:16:38,749 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 08:16:38,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7456 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13067, Invalid=33373, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:16:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 08:16:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-09-26 08:16:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:16:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-09-26 08:16:38,768 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 290 [2018-09-26 08:16:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:38,768 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-09-26 08:16:38,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:16:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-09-26 08:16:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:16:38,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:38,769 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 71, 1, 1, 1, 1] [2018-09-26 08:16:38,769 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:38,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:38,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2036609279, now seen corresponding path program 108 times [2018-09-26 08:16:38,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10368 backedges. 5256 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:39,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:39,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:16:39,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:16:39,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:16:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:16:39,143 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 77 states. [2018-09-26 08:16:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:39,422 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2018-09-26 08:16:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:16:39,422 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 292 [2018-09-26 08:16:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:39,423 INFO L225 Difference]: With dead ends: 299 [2018-09-26 08:16:39,423 INFO L226 Difference]: Without dead ends: 297 [2018-09-26 08:16:39,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5329 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8401, Invalid=13949, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:16:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-09-26 08:16:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-09-26 08:16:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 08:16:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-09-26 08:16:39,454 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 292 [2018-09-26 08:16:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:39,454 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-09-26 08:16:39,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:16:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-09-26 08:16:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 08:16:39,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:39,456 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 72, 1, 1, 1, 1] [2018-09-26 08:16:39,456 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:39,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:39,456 INFO L82 PathProgramCache]: Analyzing trace with hash -589956109, now seen corresponding path program 109 times [2018-09-26 08:16:39,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 5402 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:40,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:40,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:16:40,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:16:40,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:16:40,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5549, Invalid=16207, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:16:40,130 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 148 states. [2018-09-26 08:16:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:40,793 INFO L93 Difference]: Finished difference Result 449 states and 451 transitions. [2018-09-26 08:16:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:16:40,793 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 296 [2018-09-26 08:16:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:40,794 INFO L225 Difference]: With dead ends: 449 [2018-09-26 08:16:40,794 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:16:40,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13505, Invalid=34675, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:16:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:16:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-09-26 08:16:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:16:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-09-26 08:16:40,815 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 296 [2018-09-26 08:16:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:40,816 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-09-26 08:16:40,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:16:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-09-26 08:16:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:16:40,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:40,817 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-09-26 08:16:40,817 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:40,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:40,817 INFO L82 PathProgramCache]: Analyzing trace with hash 294894319, now seen corresponding path program 110 times [2018-09-26 08:16:40,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 5402 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:41,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:41,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:16:41,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:16:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:16:41,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:16:41,505 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 149 states. [2018-09-26 08:16:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:42,234 INFO L93 Difference]: Finished difference Result 451 states and 453 transitions. [2018-09-26 08:16:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:16:42,234 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 298 [2018-09-26 08:16:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:42,235 INFO L225 Difference]: With dead ends: 451 [2018-09-26 08:16:42,235 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 08:16:42,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7885 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13800, Invalid=35262, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:16:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 08:16:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 08:16:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:16:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-09-26 08:16:42,259 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 298 [2018-09-26 08:16:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:42,259 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-09-26 08:16:42,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:16:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-09-26 08:16:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:16:42,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:42,260 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 73, 1, 1, 1, 1] [2018-09-26 08:16:42,261 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:42,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash 232631019, now seen corresponding path program 111 times [2018-09-26 08:16:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10952 backedges. 5550 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:42,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:42,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:16:42,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:16:42,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:16:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:16:42,736 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 79 states. [2018-09-26 08:16:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:43,037 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-09-26 08:16:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:16:43,037 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 300 [2018-09-26 08:16:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:43,038 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:16:43,038 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:16:43,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8856, Invalid=14706, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:16:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:16:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-09-26 08:16:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:16:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-09-26 08:16:43,065 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 300 [2018-09-26 08:16:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:43,065 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-09-26 08:16:43,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:16:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-09-26 08:16:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:16:43,066 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:43,066 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 74, 1, 1, 1, 1] [2018-09-26 08:16:43,066 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:43,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1122541535, now seen corresponding path program 112 times [2018-09-26 08:16:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11250 backedges. 5700 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:43,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:43,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:16:43,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:16:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:16:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5851, Invalid=17101, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:16:43,793 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 152 states. [2018-09-26 08:16:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,593 INFO L93 Difference]: Finished difference Result 461 states and 463 transitions. [2018-09-26 08:16:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:16:44,594 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 304 [2018-09-26 08:16:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,594 INFO L225 Difference]: With dead ends: 461 [2018-09-26 08:16:44,595 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:16:44,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14250, Invalid=36600, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:16:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:16:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-26 08:16:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:16:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-09-26 08:16:44,619 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 304 [2018-09-26 08:16:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,619 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-09-26 08:16:44,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:16:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-09-26 08:16:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:16:44,620 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,620 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-09-26 08:16:44,621 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash 677749467, now seen corresponding path program 113 times [2018-09-26 08:16:44,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5700 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:45,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:45,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:16:45,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:16:45,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:16:45,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:16:45,439 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 153 states. [2018-09-26 08:16:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:46,192 INFO L93 Difference]: Finished difference Result 463 states and 465 transitions. [2018-09-26 08:16:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:16:46,192 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 306 [2018-09-26 08:16:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:46,193 INFO L225 Difference]: With dead ends: 463 [2018-09-26 08:16:46,193 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:16:46,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14553, Invalid=37203, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:16:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:16:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-09-26 08:16:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 08:16:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-09-26 08:16:46,217 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 306 [2018-09-26 08:16:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:46,218 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-09-26 08:16:46,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:16:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-09-26 08:16:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 08:16:46,219 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:46,219 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 75, 1, 1, 1, 1] [2018-09-26 08:16:46,219 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:46,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1565665577, now seen corresponding path program 114 times [2018-09-26 08:16:46,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11552 backedges. 5852 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:16:46,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:16:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:16:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:16:46,681 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 81 states. [2018-09-26 08:16:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:47,016 INFO L93 Difference]: Finished difference Result 315 states and 317 transitions. [2018-09-26 08:16:47,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:16:47,016 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 308 [2018-09-26 08:16:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:47,017 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:16:47,017 INFO L226 Difference]: Without dead ends: 313 [2018-09-26 08:16:47,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5929 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9323, Invalid=15483, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:16:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-26 08:16:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-09-26 08:16:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 08:16:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-09-26 08:16:47,041 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 308 [2018-09-26 08:16:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:47,042 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-09-26 08:16:47,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:16:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-09-26 08:16:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 08:16:47,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:47,043 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 76, 1, 1, 1, 1] [2018-09-26 08:16:47,043 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:47,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1521022411, now seen corresponding path program 115 times [2018-09-26 08:16:47,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 6006 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:47,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:47,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:16:47,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:16:47,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:16:47,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6161, Invalid=18019, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:16:47,867 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 156 states. [2018-09-26 08:16:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:48,669 INFO L93 Difference]: Finished difference Result 473 states and 475 transitions. [2018-09-26 08:16:48,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:16:48,669 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 312 [2018-09-26 08:16:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:48,670 INFO L225 Difference]: With dead ends: 473 [2018-09-26 08:16:48,670 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:16:48,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15015, Invalid=38577, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:16:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:16:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-09-26 08:16:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:16:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-09-26 08:16:48,701 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 312 [2018-09-26 08:16:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,701 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-09-26 08:16:48,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:16:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-09-26 08:16:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:16:48,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,703 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-09-26 08:16:48,703 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash -278840121, now seen corresponding path program 116 times [2018-09-26 08:16:48,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 6006 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:49,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:49,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:16:49,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:16:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:16:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:16:49,603 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 157 states. [2018-09-26 08:16:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,275 INFO L93 Difference]: Finished difference Result 475 states and 477 transitions. [2018-09-26 08:16:50,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:16:50,275 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 314 [2018-09-26 08:16:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,275 INFO L225 Difference]: With dead ends: 475 [2018-09-26 08:16:50,276 INFO L226 Difference]: Without dead ends: 317 [2018-09-26 08:16:50,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8779 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15326, Invalid=39196, Unknown=0, NotChecked=0, Total=54522 [2018-09-26 08:16:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-09-26 08:16:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-09-26 08:16:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-09-26 08:16:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-09-26 08:16:50,305 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 314 [2018-09-26 08:16:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,305 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-09-26 08:16:50,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:16:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-09-26 08:16:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-26 08:16:50,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,307 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 77, 1, 1, 1, 1] [2018-09-26 08:16:50,307 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 925086915, now seen corresponding path program 117 times [2018-09-26 08:16:50,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12168 backedges. 6162 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:50,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:50,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:16:50,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:16:50,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:16:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:16:50,785 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 83 states. [2018-09-26 08:16:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:51,118 INFO L93 Difference]: Finished difference Result 323 states and 325 transitions. [2018-09-26 08:16:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:16:51,118 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 316 [2018-09-26 08:16:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:51,119 INFO L225 Difference]: With dead ends: 323 [2018-09-26 08:16:51,119 INFO L226 Difference]: Without dead ends: 321 [2018-09-26 08:16:51,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9802, Invalid=16280, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:16:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-09-26 08:16:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-09-26 08:16:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-09-26 08:16:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-09-26 08:16:51,141 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 316 [2018-09-26 08:16:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:51,141 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-09-26 08:16:51,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:16:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-09-26 08:16:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-26 08:16:51,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:51,142 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 78, 1, 1, 1, 1] [2018-09-26 08:16:51,143 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:51,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash -471466569, now seen corresponding path program 118 times [2018-09-26 08:16:51,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 6320 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:51,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:51,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:16:51,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:16:51,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:16:51,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6479, Invalid=18961, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:16:51,941 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 160 states. [2018-09-26 08:16:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:52,647 INFO L93 Difference]: Finished difference Result 485 states and 487 transitions. [2018-09-26 08:16:52,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:16:52,647 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 320 [2018-09-26 08:16:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:52,648 INFO L225 Difference]: With dead ends: 485 [2018-09-26 08:16:52,648 INFO L226 Difference]: Without dead ends: 323 [2018-09-26 08:16:52,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15800, Invalid=40606, Unknown=0, NotChecked=0, Total=56406 [2018-09-26 08:16:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-09-26 08:16:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-09-26 08:16:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-26 08:16:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-09-26 08:16:52,672 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 320 [2018-09-26 08:16:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:52,672 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-09-26 08:16:52,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:16:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-09-26 08:16:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-26 08:16:52,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:52,673 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1] [2018-09-26 08:16:52,673 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:52,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash -363493197, now seen corresponding path program 119 times [2018-09-26 08:16:52,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 6320 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:53,565 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:53,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:16:53,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:16:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:16:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:16:53,568 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 161 states. [2018-09-26 08:16:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:54,300 INFO L93 Difference]: Finished difference Result 487 states and 489 transitions. [2018-09-26 08:16:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:16:54,300 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 322 [2018-09-26 08:16:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:54,301 INFO L225 Difference]: With dead ends: 487 [2018-09-26 08:16:54,301 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:16:54,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16119, Invalid=41241, Unknown=0, NotChecked=0, Total=57360 [2018-09-26 08:16:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:16:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-09-26 08:16:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-26 08:16:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-09-26 08:16:54,329 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 322 [2018-09-26 08:16:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:54,329 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-09-26 08:16:54,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:16:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-09-26 08:16:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-09-26 08:16:54,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:54,331 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 79, 1, 1, 1, 1] [2018-09-26 08:16:54,331 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:54,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash 319702191, now seen corresponding path program 120 times [2018-09-26 08:16:54,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12800 backedges. 6480 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:54,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:54,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:16:54,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:16:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:16:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:16:54,848 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 85 states. [2018-09-26 08:16:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:55,187 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-09-26 08:16:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:16:55,187 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 324 [2018-09-26 08:16:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:55,188 INFO L225 Difference]: With dead ends: 331 [2018-09-26 08:16:55,188 INFO L226 Difference]: Without dead ends: 329 [2018-09-26 08:16:55,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6561 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10293, Invalid=17097, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:16:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-09-26 08:16:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-09-26 08:16:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-09-26 08:16:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-09-26 08:16:55,216 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 324 [2018-09-26 08:16:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:55,217 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-09-26 08:16:55,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:16:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-09-26 08:16:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-26 08:16:55,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:55,218 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 80, 1, 1, 1, 1] [2018-09-26 08:16:55,218 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:55,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1494304861, now seen corresponding path program 121 times [2018-09-26 08:16:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13122 backedges. 6642 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:56,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:56,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:16:56,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:16:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:16:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6805, Invalid=19927, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:16:56,187 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 164 states. [2018-09-26 08:16:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:57,041 INFO L93 Difference]: Finished difference Result 497 states and 499 transitions. [2018-09-26 08:16:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:16:57,041 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 328 [2018-09-26 08:16:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:57,042 INFO L225 Difference]: With dead ends: 497 [2018-09-26 08:16:57,042 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:16:57,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9640 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16605, Invalid=42687, Unknown=0, NotChecked=0, Total=59292 [2018-09-26 08:16:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:16:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-09-26 08:16:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:16:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-09-26 08:16:57,066 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 328 [2018-09-26 08:16:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:57,066 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-09-26 08:16:57,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:16:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-09-26 08:16:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:16:57,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:57,067 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1] [2018-09-26 08:16:57,067 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:57,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1517189473, now seen corresponding path program 122 times [2018-09-26 08:16:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 6642 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:57,914 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:57,914 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:16:57,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:16:57,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:16:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:16:57,916 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 165 states. [2018-09-26 08:16:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:58,864 INFO L93 Difference]: Finished difference Result 499 states and 501 transitions. [2018-09-26 08:16:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:16:58,864 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 330 [2018-09-26 08:16:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:58,865 INFO L225 Difference]: With dead ends: 499 [2018-09-26 08:16:58,865 INFO L226 Difference]: Without dead ends: 333 [2018-09-26 08:16:58,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9721 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16932, Invalid=43338, Unknown=0, NotChecked=0, Total=60270 [2018-09-26 08:16:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-09-26 08:16:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-09-26 08:16:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-09-26 08:16:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-09-26 08:16:58,902 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 330 [2018-09-26 08:16:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:58,902 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-09-26 08:16:58,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:16:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-09-26 08:16:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-26 08:16:58,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:58,904 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 81, 1, 1, 1, 1] [2018-09-26 08:16:58,904 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:58,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2034465125, now seen corresponding path program 123 times [2018-09-26 08:16:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13448 backedges. 6806 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:59,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:59,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:16:59,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:16:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:16:59,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:16:59,498 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 87 states. [2018-09-26 08:16:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:59,823 INFO L93 Difference]: Finished difference Result 339 states and 341 transitions. [2018-09-26 08:16:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:16:59,824 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 332 [2018-09-26 08:16:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:59,824 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:16:59,824 INFO L226 Difference]: Without dead ends: 337 [2018-09-26 08:16:59,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6889 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10796, Invalid=17934, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:16:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-09-26 08:16:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-09-26 08:16:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 08:16:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-09-26 08:16:59,848 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 332 [2018-09-26 08:16:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:59,849 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-09-26 08:16:59,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:16:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-09-26 08:16:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-09-26 08:16:59,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:59,850 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 82, 1, 1, 1, 1] [2018-09-26 08:16:59,851 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:59,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash 881992591, now seen corresponding path program 124 times [2018-09-26 08:16:59,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13778 backedges. 6972 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:00,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:00,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:17:00,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:17:00,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:17:00,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7139, Invalid=20917, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:17:00,851 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 168 states. [2018-09-26 08:17:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:01,784 INFO L93 Difference]: Finished difference Result 509 states and 511 transitions. [2018-09-26 08:17:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:17:01,785 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 336 [2018-09-26 08:17:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:01,786 INFO L225 Difference]: With dead ends: 509 [2018-09-26 08:17:01,786 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:17:01,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17430, Invalid=44820, Unknown=0, NotChecked=0, Total=62250 [2018-09-26 08:17:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:17:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-09-26 08:17:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:17:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-09-26 08:17:01,816 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 336 [2018-09-26 08:17:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:01,817 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-09-26 08:17:01,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:17:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-09-26 08:17:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-26 08:17:01,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:01,818 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1] [2018-09-26 08:17:01,818 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:01,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1977890443, now seen corresponding path program 125 times [2018-09-26 08:17:01,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 6972 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:02,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:02,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:17:02,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:17:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:17:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:17:02,801 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 169 states. [2018-09-26 08:17:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:03,692 INFO L93 Difference]: Finished difference Result 511 states and 513 transitions. [2018-09-26 08:17:03,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:17:03,693 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 338 [2018-09-26 08:17:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:03,694 INFO L225 Difference]: With dead ends: 511 [2018-09-26 08:17:03,694 INFO L226 Difference]: Without dead ends: 341 [2018-09-26 08:17:03,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17765, Invalid=45487, Unknown=0, NotChecked=0, Total=63252 [2018-09-26 08:17:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-09-26 08:17:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-09-26 08:17:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 08:17:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-09-26 08:17:03,722 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 338 [2018-09-26 08:17:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:03,722 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-09-26 08:17:03,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:17:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-09-26 08:17:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-26 08:17:03,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:03,723 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 83, 1, 1, 1, 1] [2018-09-26 08:17:03,724 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:03,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1426228601, now seen corresponding path program 126 times [2018-09-26 08:17:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 7140 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:04,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:04,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:17:04,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:17:04,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:17:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:17:04,339 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 89 states. [2018-09-26 08:17:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:04,675 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-09-26 08:17:04,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:17:04,675 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 340 [2018-09-26 08:17:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:04,676 INFO L225 Difference]: With dead ends: 347 [2018-09-26 08:17:04,676 INFO L226 Difference]: Without dead ends: 345 [2018-09-26 08:17:04,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11311, Invalid=18791, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:17:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-09-26 08:17:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-09-26 08:17:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 08:17:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-09-26 08:17:04,702 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 340 [2018-09-26 08:17:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:04,703 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-09-26 08:17:04,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:17:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-09-26 08:17:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-26 08:17:04,704 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:04,704 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 84, 1, 1, 1, 1] [2018-09-26 08:17:04,704 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:04,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1507901061, now seen corresponding path program 127 times [2018-09-26 08:17:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14450 backedges. 7310 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:05,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:05,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:17:05,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:17:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:17:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7481, Invalid=21931, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:17:05,644 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 172 states. [2018-09-26 08:17:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:06,729 INFO L93 Difference]: Finished difference Result 521 states and 523 transitions. [2018-09-26 08:17:06,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:17:06,729 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 344 [2018-09-26 08:17:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:06,730 INFO L225 Difference]: With dead ends: 521 [2018-09-26 08:17:06,730 INFO L226 Difference]: Without dead ends: 347 [2018-09-26 08:17:06,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10626 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=18275, Invalid=47005, Unknown=0, NotChecked=0, Total=65280 [2018-09-26 08:17:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-26 08:17:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-09-26 08:17:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-09-26 08:17:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-09-26 08:17:06,776 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 344 [2018-09-26 08:17:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:06,776 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-09-26 08:17:06,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:17:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-09-26 08:17:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-26 08:17:06,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:06,778 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1] [2018-09-26 08:17:06,778 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:06,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 949786743, now seen corresponding path program 128 times [2018-09-26 08:17:06,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 7310 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:07,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:07,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:17:07,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:17:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:17:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:17:07,859 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 173 states. [2018-09-26 08:17:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:08,656 INFO L93 Difference]: Finished difference Result 523 states and 525 transitions. [2018-09-26 08:17:08,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:17:08,656 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 346 [2018-09-26 08:17:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:08,657 INFO L225 Difference]: With dead ends: 523 [2018-09-26 08:17:08,657 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 08:17:08,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10711 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18618, Invalid=47688, Unknown=0, NotChecked=0, Total=66306 [2018-09-26 08:17:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 08:17:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-09-26 08:17:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 08:17:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-09-26 08:17:08,689 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 346 [2018-09-26 08:17:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:08,689 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-09-26 08:17:08,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:17:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-09-26 08:17:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-09-26 08:17:08,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:08,690 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 85, 1, 1, 1, 1] [2018-09-26 08:17:08,690 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:08,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 555753587, now seen corresponding path program 129 times [2018-09-26 08:17:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14792 backedges. 7482 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:09,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:09,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:17:09,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:17:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:17:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:17:09,326 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 91 states. [2018-09-26 08:17:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:09,706 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-09-26 08:17:09,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:17:09,706 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 348 [2018-09-26 08:17:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:09,707 INFO L225 Difference]: With dead ends: 355 [2018-09-26 08:17:09,707 INFO L226 Difference]: Without dead ends: 353 [2018-09-26 08:17:09,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7569 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11838, Invalid=19668, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:17:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-09-26 08:17:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-09-26 08:17:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-09-26 08:17:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-09-26 08:17:09,737 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 348 [2018-09-26 08:17:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:09,738 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-09-26 08:17:09,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:17:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-09-26 08:17:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-26 08:17:09,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:09,739 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 86, 1, 1, 1, 1] [2018-09-26 08:17:09,739 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:09,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1566904679, now seen corresponding path program 130 times [2018-09-26 08:17:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15138 backedges. 7656 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:10,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:10,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:17:10,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:17:10,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:17:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7831, Invalid=22969, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:17:10,882 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 176 states. [2018-09-26 08:17:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:11,872 INFO L93 Difference]: Finished difference Result 533 states and 535 transitions. [2018-09-26 08:17:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:17:11,872 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 352 [2018-09-26 08:17:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:11,873 INFO L225 Difference]: With dead ends: 533 [2018-09-26 08:17:11,873 INFO L226 Difference]: Without dead ends: 355 [2018-09-26 08:17:11,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19140, Invalid=49242, Unknown=0, NotChecked=0, Total=68382 [2018-09-26 08:17:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-09-26 08:17:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-09-26 08:17:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-26 08:17:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-09-26 08:17:11,900 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 352 [2018-09-26 08:17:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:11,900 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-09-26 08:17:11,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:17:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-09-26 08:17:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-09-26 08:17:11,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:11,902 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1, 1, 1] [2018-09-26 08:17:11,902 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:11,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash 327789667, now seen corresponding path program 131 times [2018-09-26 08:17:11,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 7656 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:12,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:12,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:17:12,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:17:12,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:17:12,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:17:12,896 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 177 states. [2018-09-26 08:17:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:13,776 INFO L93 Difference]: Finished difference Result 535 states and 537 transitions. [2018-09-26 08:17:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:17:13,776 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 354 [2018-09-26 08:17:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:13,777 INFO L225 Difference]: With dead ends: 535 [2018-09-26 08:17:13,777 INFO L226 Difference]: Without dead ends: 357 [2018-09-26 08:17:13,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19491, Invalid=49941, Unknown=0, NotChecked=0, Total=69432 [2018-09-26 08:17:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-09-26 08:17:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-09-26 08:17:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-09-26 08:17:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-09-26 08:17:13,824 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 354 [2018-09-26 08:17:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:13,824 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-09-26 08:17:13,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:17:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-09-26 08:17:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-09-26 08:17:13,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:13,826 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 87, 1, 1, 1, 1] [2018-09-26 08:17:13,826 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:13,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash -755795873, now seen corresponding path program 132 times [2018-09-26 08:17:13,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15488 backedges. 7832 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:14,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:14,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:17:14,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:17:14,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:17:14,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:17:14,590 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 93 states. [2018-09-26 08:17:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:14,925 INFO L93 Difference]: Finished difference Result 363 states and 365 transitions. [2018-09-26 08:17:14,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:17:14,925 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 356 [2018-09-26 08:17:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:14,926 INFO L225 Difference]: With dead ends: 363 [2018-09-26 08:17:14,926 INFO L226 Difference]: Without dead ends: 361 [2018-09-26 08:17:14,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7921 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12377, Invalid=20565, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:17:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-09-26 08:17:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-09-26 08:17:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-09-26 08:17:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-09-26 08:17:14,953 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 356 [2018-09-26 08:17:14,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:14,953 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-09-26 08:17:14,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:17:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-09-26 08:17:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-09-26 08:17:14,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:14,955 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 88, 1, 1, 1, 1] [2018-09-26 08:17:14,955 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:14,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash -994929837, now seen corresponding path program 133 times [2018-09-26 08:17:14,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15842 backedges. 8010 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:15,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:15,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:17:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:17:15,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:17:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8189, Invalid=24031, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:17:15,960 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 180 states. [2018-09-26 08:17:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:16,870 INFO L93 Difference]: Finished difference Result 545 states and 547 transitions. [2018-09-26 08:17:16,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:17:16,871 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 360 [2018-09-26 08:17:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:16,872 INFO L225 Difference]: With dead ends: 545 [2018-09-26 08:17:16,872 INFO L226 Difference]: Without dead ends: 363 [2018-09-26 08:17:16,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20025, Invalid=51531, Unknown=0, NotChecked=0, Total=71556 [2018-09-26 08:17:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-09-26 08:17:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-09-26 08:17:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-09-26 08:17:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-09-26 08:17:16,903 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 360 [2018-09-26 08:17:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:16,903 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-09-26 08:17:16,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:17:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-09-26 08:17:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-09-26 08:17:16,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:16,905 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1, 1, 1] [2018-09-26 08:17:16,905 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:16,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:16,906 INFO L82 PathProgramCache]: Analyzing trace with hash 888828495, now seen corresponding path program 134 times [2018-09-26 08:17:16,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 8010 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:17,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:17,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:17:17,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:17:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:17:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:17:17,983 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 181 states. [2018-09-26 08:17:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:18,878 INFO L93 Difference]: Finished difference Result 547 states and 549 transitions. [2018-09-26 08:17:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:17:18,878 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 362 [2018-09-26 08:17:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:18,879 INFO L225 Difference]: With dead ends: 547 [2018-09-26 08:17:18,879 INFO L226 Difference]: Without dead ends: 365 [2018-09-26 08:17:18,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11749 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20384, Invalid=52246, Unknown=0, NotChecked=0, Total=72630 [2018-09-26 08:17:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-09-26 08:17:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-09-26 08:17:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-09-26 08:17:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-09-26 08:17:18,908 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 362 [2018-09-26 08:17:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:18,908 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-09-26 08:17:18,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:17:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-09-26 08:17:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-09-26 08:17:18,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:18,909 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 90, 89, 1, 1, 1, 1] [2018-09-26 08:17:18,909 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:18,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1295613365, now seen corresponding path program 135 times [2018-09-26 08:17:18,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16200 backedges. 8190 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:19,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:19,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:17:19,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:17:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:17:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:17:19,528 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 95 states. [2018-09-26 08:17:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:19,896 INFO L93 Difference]: Finished difference Result 371 states and 373 transitions. [2018-09-26 08:17:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:17:19,896 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 364 [2018-09-26 08:17:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:19,897 INFO L225 Difference]: With dead ends: 371 [2018-09-26 08:17:19,897 INFO L226 Difference]: Without dead ends: 369 [2018-09-26 08:17:19,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12928, Invalid=21482, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:17:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-09-26 08:17:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-09-26 08:17:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-09-26 08:17:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-09-26 08:17:19,926 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 364 [2018-09-26 08:17:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:19,926 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-09-26 08:17:19,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:17:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-09-26 08:17:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-26 08:17:19,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:19,927 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 91, 90, 1, 1, 1, 1] [2018-09-26 08:17:19,928 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:19,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash 248956735, now seen corresponding path program 136 times [2018-09-26 08:17:19,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16562 backedges. 8372 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:21,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:17:21,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:17:21,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:17:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8555, Invalid=25117, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:17:21,092 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 184 states. [2018-09-26 08:17:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:22,069 INFO L93 Difference]: Finished difference Result 557 states and 559 transitions. [2018-09-26 08:17:22,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:17:22,069 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 368 [2018-09-26 08:17:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:22,071 INFO L225 Difference]: With dead ends: 557 [2018-09-26 08:17:22,071 INFO L226 Difference]: Without dead ends: 371 [2018-09-26 08:17:22,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12195 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20930, Invalid=53872, Unknown=0, NotChecked=0, Total=74802 [2018-09-26 08:17:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-09-26 08:17:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-09-26 08:17:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 08:17:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-09-26 08:17:22,119 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 368 [2018-09-26 08:17:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:22,120 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-09-26 08:17:22,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:17:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-09-26 08:17:22,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-26 08:17:22,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:22,122 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1, 1, 1] [2018-09-26 08:17:22,122 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:22,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:22,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1816270277, now seen corresponding path program 137 times [2018-09-26 08:17:22,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8372 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:23,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:23,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:17:23,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:17:23,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:17:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8648, Invalid=25392, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:17:23,395 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 185 states. [2018-09-26 08:17:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:24,638 INFO L93 Difference]: Finished difference Result 559 states and 561 transitions. [2018-09-26 08:17:24,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:17:24,638 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 370 [2018-09-26 08:17:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:24,639 INFO L225 Difference]: With dead ends: 559 [2018-09-26 08:17:24,639 INFO L226 Difference]: Without dead ends: 373 [2018-09-26 08:17:24,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12286 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21297, Invalid=54603, Unknown=0, NotChecked=0, Total=75900 [2018-09-26 08:17:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-09-26 08:17:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-09-26 08:17:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-26 08:17:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-09-26 08:17:24,675 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 370 [2018-09-26 08:17:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:24,675 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-09-26 08:17:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:17:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-09-26 08:17:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-09-26 08:17:24,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:24,676 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 91, 1, 1, 1, 1] [2018-09-26 08:17:24,677 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:24,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2070429239, now seen corresponding path program 138 times [2018-09-26 08:17:24,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 8556 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:25,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:25,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:17:25,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:17:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:17:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:17:25,461 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 97 states. [2018-09-26 08:17:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:25,890 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-09-26 08:17:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:17:25,890 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 372 [2018-09-26 08:17:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:25,891 INFO L225 Difference]: With dead ends: 379 [2018-09-26 08:17:25,891 INFO L226 Difference]: Without dead ends: 377 [2018-09-26 08:17:25,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8649 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13491, Invalid=22419, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:17:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-09-26 08:17:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-09-26 08:17:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-09-26 08:17:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-09-26 08:17:25,919 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 372 [2018-09-26 08:17:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:25,919 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-09-26 08:17:25,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:17:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-09-26 08:17:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-09-26 08:17:25,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:25,921 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 93, 92, 1, 1, 1, 1] [2018-09-26 08:17:25,921 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:25,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:25,921 INFO L82 PathProgramCache]: Analyzing trace with hash -148853461, now seen corresponding path program 139 times [2018-09-26 08:17:25,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 17298 backedges. 8742 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:27,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:27,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:17:27,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:17:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:17:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8929, Invalid=26227, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:17:27,161 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 188 states. [2018-09-26 08:17:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:28,462 INFO L93 Difference]: Finished difference Result 569 states and 571 transitions. [2018-09-26 08:17:28,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:17:28,462 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 376 [2018-09-26 08:17:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:28,463 INFO L225 Difference]: With dead ends: 569 [2018-09-26 08:17:28,464 INFO L226 Difference]: Without dead ends: 379 [2018-09-26 08:17:28,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21855, Invalid=56265, Unknown=0, NotChecked=0, Total=78120 [2018-09-26 08:17:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-26 08:17:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-09-26 08:17:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-09-26 08:17:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-09-26 08:17:28,496 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 376 [2018-09-26 08:17:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:28,496 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-09-26 08:17:28,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:17:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-09-26 08:17:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-09-26 08:17:28,497 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:28,498 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1, 1, 1] [2018-09-26 08:17:28,498 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:28,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1356655577, now seen corresponding path program 140 times [2018-09-26 08:17:28,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 8742 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:29,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:29,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:17:29,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:17:29,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:17:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9024, Invalid=26508, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:17:29,721 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 189 states. [2018-09-26 08:17:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:30,940 INFO L93 Difference]: Finished difference Result 571 states and 573 transitions. [2018-09-26 08:17:30,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:17:30,940 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 378 [2018-09-26 08:17:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:30,941 INFO L225 Difference]: With dead ends: 571 [2018-09-26 08:17:30,941 INFO L226 Difference]: Without dead ends: 381 [2018-09-26 08:17:30,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12835 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22230, Invalid=57012, Unknown=0, NotChecked=0, Total=79242 [2018-09-26 08:17:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-09-26 08:17:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-09-26 08:17:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:17:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2018-09-26 08:17:30,994 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 378 [2018-09-26 08:17:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:30,994 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2018-09-26 08:17:30,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:17:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2018-09-26 08:17:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-09-26 08:17:30,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:30,996 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 94, 93, 1, 1, 1, 1] [2018-09-26 08:17:30,997 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:30,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1881648163, now seen corresponding path program 141 times [2018-09-26 08:17:30,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17672 backedges. 8930 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:31,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:31,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:17:31,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:17:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:17:31,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:17:31,734 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand 99 states. [2018-09-26 08:17:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:32,135 INFO L93 Difference]: Finished difference Result 387 states and 389 transitions. [2018-09-26 08:17:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:17:32,135 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 380 [2018-09-26 08:17:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:32,136 INFO L225 Difference]: With dead ends: 387 [2018-09-26 08:17:32,136 INFO L226 Difference]: Without dead ends: 385 [2018-09-26 08:17:32,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9025 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14066, Invalid=23376, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:17:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-09-26 08:17:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-09-26 08:17:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-09-26 08:17:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-09-26 08:17:32,166 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 380 [2018-09-26 08:17:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:32,166 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-09-26 08:17:32,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:17:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-09-26 08:17:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-09-26 08:17:32,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:32,167 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 95, 94, 1, 1, 1, 1] [2018-09-26 08:17:32,167 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:32,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2124462825, now seen corresponding path program 142 times [2018-09-26 08:17:32,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18050 backedges. 9120 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:33,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:33,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:17:33,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:17:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:17:33,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9311, Invalid=27361, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:17:33,408 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 192 states. [2018-09-26 08:17:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:34,821 INFO L93 Difference]: Finished difference Result 581 states and 583 transitions. [2018-09-26 08:17:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:17:34,822 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 384 [2018-09-26 08:17:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:34,822 INFO L225 Difference]: With dead ends: 581 [2018-09-26 08:17:34,822 INFO L226 Difference]: Without dead ends: 387 [2018-09-26 08:17:34,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13301 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22800, Invalid=58710, Unknown=0, NotChecked=0, Total=81510 [2018-09-26 08:17:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-09-26 08:17:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-09-26 08:17:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-26 08:17:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-09-26 08:17:34,854 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 384 [2018-09-26 08:17:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:34,855 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-09-26 08:17:34,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:17:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-09-26 08:17:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-09-26 08:17:34,856 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:34,856 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1, 1, 1] [2018-09-26 08:17:34,856 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:34,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1324937235, now seen corresponding path program 143 times [2018-09-26 08:17:34,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 9120 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:36,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:36,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:17:36,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:17:36,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:17:36,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9408, Invalid=27648, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:17:36,158 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 193 states. [2018-09-26 08:17:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,385 INFO L93 Difference]: Finished difference Result 583 states and 585 transitions. [2018-09-26 08:17:37,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:17:37,385 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 386 [2018-09-26 08:17:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,386 INFO L225 Difference]: With dead ends: 583 [2018-09-26 08:17:37,386 INFO L226 Difference]: Without dead ends: 389 [2018-09-26 08:17:37,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13396 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23183, Invalid=59473, Unknown=0, NotChecked=0, Total=82656 [2018-09-26 08:17:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-09-26 08:17:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-09-26 08:17:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-09-26 08:17:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-09-26 08:17:37,437 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 386 [2018-09-26 08:17:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,437 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-09-26 08:17:37,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:17:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-09-26 08:17:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-09-26 08:17:37,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,440 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 96, 95, 1, 1, 1, 1] [2018-09-26 08:17:37,440 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash 483642383, now seen corresponding path program 144 times [2018-09-26 08:17:37,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18432 backedges. 9312 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:38,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:38,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:17:38,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:17:38,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:17:38,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:17:38,329 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 101 states. [2018-09-26 08:17:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,732 INFO L93 Difference]: Finished difference Result 395 states and 397 transitions. [2018-09-26 08:17:38,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:17:38,733 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 388 [2018-09-26 08:17:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,733 INFO L225 Difference]: With dead ends: 395 [2018-09-26 08:17:38,733 INFO L226 Difference]: Without dead ends: 393 [2018-09-26 08:17:38,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9409 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14653, Invalid=24353, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:17:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-09-26 08:17:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-09-26 08:17:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-26 08:17:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-09-26 08:17:38,766 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 388 [2018-09-26 08:17:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:38,766 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-09-26 08:17:38,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:17:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-09-26 08:17:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-09-26 08:17:38,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:38,767 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 97, 96, 1, 1, 1, 1] [2018-09-26 08:17:38,767 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:38,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1176400125, now seen corresponding path program 145 times [2018-09-26 08:17:38,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18818 backedges. 9506 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:40,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:40,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:17:40,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:17:40,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:17:40,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9701, Invalid=28519, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:17:40,252 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 196 states. [2018-09-26 08:17:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:41,519 INFO L93 Difference]: Finished difference Result 593 states and 595 transitions. [2018-09-26 08:17:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:17:41,519 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 392 [2018-09-26 08:17:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:41,520 INFO L225 Difference]: With dead ends: 593 [2018-09-26 08:17:41,520 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 08:17:41,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13872 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=23765, Invalid=61207, Unknown=0, NotChecked=0, Total=84972 [2018-09-26 08:17:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 08:17:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-26 08:17:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 08:17:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-09-26 08:17:41,555 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 392 [2018-09-26 08:17:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:41,555 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-09-26 08:17:41,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:17:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-09-26 08:17:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-09-26 08:17:41,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:41,557 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1, 1, 1] [2018-09-26 08:17:41,557 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:41,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1133411839, now seen corresponding path program 146 times [2018-09-26 08:17:41,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 9506 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:42,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:42,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:17:42,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:17:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:17:42,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9800, Invalid=28812, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:17:42,882 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 197 states. [2018-09-26 08:17:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:44,168 INFO L93 Difference]: Finished difference Result 595 states and 597 transitions. [2018-09-26 08:17:44,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:17:44,168 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 394 [2018-09-26 08:17:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:44,169 INFO L225 Difference]: With dead ends: 595 [2018-09-26 08:17:44,169 INFO L226 Difference]: Without dead ends: 397 [2018-09-26 08:17:44,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13969 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24156, Invalid=61986, Unknown=0, NotChecked=0, Total=86142 [2018-09-26 08:17:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-09-26 08:17:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-09-26 08:17:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-26 08:17:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-09-26 08:17:44,208 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 394 [2018-09-26 08:17:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:44,209 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-09-26 08:17:44,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:17:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-09-26 08:17:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-09-26 08:17:44,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:44,210 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 97, 1, 1, 1, 1] [2018-09-26 08:17:44,211 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:44,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash 364617211, now seen corresponding path program 147 times [2018-09-26 08:17:44,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 9702 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:45,031 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:45,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:17:45,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:17:45,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:17:45,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:45,032 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 103 states. [2018-09-26 08:17:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:45,636 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-09-26 08:17:45,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:17:45,636 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 396 [2018-09-26 08:17:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:45,636 INFO L225 Difference]: With dead ends: 403 [2018-09-26 08:17:45,637 INFO L226 Difference]: Without dead ends: 401 [2018-09-26 08:17:45,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9801 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15252, Invalid=25350, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:17:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-09-26 08:17:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-09-26 08:17:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-09-26 08:17:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-09-26 08:17:45,679 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 396 [2018-09-26 08:17:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:45,679 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-09-26 08:17:45,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:17:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-09-26 08:17:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-09-26 08:17:45,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:45,681 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 99, 98, 1, 1, 1, 1] [2018-09-26 08:17:45,681 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:45,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1970703087, now seen corresponding path program 148 times [2018-09-26 08:17:45,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 19602 backedges. 9900 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:47,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:47,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:17:47,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:17:47,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:17:47,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10099, Invalid=29701, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:17:47,052 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 200 states. [2018-09-26 08:17:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:48,425 INFO L93 Difference]: Finished difference Result 605 states and 607 transitions. [2018-09-26 08:17:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:17:48,425 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 400 [2018-09-26 08:17:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:48,426 INFO L225 Difference]: With dead ends: 605 [2018-09-26 08:17:48,426 INFO L226 Difference]: Without dead ends: 403 [2018-09-26 08:17:48,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14455 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24750, Invalid=63756, Unknown=0, NotChecked=0, Total=88506 [2018-09-26 08:17:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-26 08:17:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-26 08:17:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 08:17:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-09-26 08:17:48,462 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 400 [2018-09-26 08:17:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:48,462 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-09-26 08:17:48,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:17:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-09-26 08:17:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-26 08:17:48,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:48,464 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1, 1, 1] [2018-09-26 08:17:48,464 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:48,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash 632471019, now seen corresponding path program 149 times [2018-09-26 08:17:48,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 9900 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:49,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:49,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:17:49,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:17:49,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:17:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10200, Invalid=30000, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:17:49,838 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 201 states. [2018-09-26 08:17:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:51,242 INFO L93 Difference]: Finished difference Result 607 states and 609 transitions. [2018-09-26 08:17:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:17:51,243 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 402 [2018-09-26 08:17:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:51,244 INFO L225 Difference]: With dead ends: 607 [2018-09-26 08:17:51,244 INFO L226 Difference]: Without dead ends: 405 [2018-09-26 08:17:51,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14554 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=25149, Invalid=64551, Unknown=0, NotChecked=0, Total=89700 [2018-09-26 08:17:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-09-26 08:17:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-09-26 08:17:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-09-26 08:17:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-09-26 08:17:51,281 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 402 [2018-09-26 08:17:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:51,281 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-09-26 08:17:51,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:17:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-09-26 08:17:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-09-26 08:17:51,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:51,282 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 100, 99, 1, 1, 1, 1] [2018-09-26 08:17:51,282 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:51,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1213324825, now seen corresponding path program 150 times [2018-09-26 08:17:51,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20000 backedges. 10100 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:52,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:52,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:17:52,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:17:52,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:17:52,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5358, Invalid=5562, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:17:52,214 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 105 states. [2018-09-26 08:17:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:52,678 INFO L93 Difference]: Finished difference Result 411 states and 413 transitions. [2018-09-26 08:17:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:17:52,678 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2018-09-26 08:17:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:52,679 INFO L225 Difference]: With dead ends: 411 [2018-09-26 08:17:52,679 INFO L226 Difference]: Without dead ends: 409 [2018-09-26 08:17:52,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15863, Invalid=26367, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:17:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-09-26 08:17:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-09-26 08:17:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 08:17:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-09-26 08:17:52,735 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 404 [2018-09-26 08:17:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:52,735 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-09-26 08:17:52,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:17:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-09-26 08:17:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-09-26 08:17:52,738 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:52,738 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 101, 100, 1, 1, 1, 1] [2018-09-26 08:17:52,738 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:52,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash 292370651, now seen corresponding path program 151 times [2018-09-26 08:17:52,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20402 backedges. 10302 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:54,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:54,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:17:54,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:17:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:17:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10505, Invalid=30907, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:17:54,355 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 204 states. [2018-09-26 08:17:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:55,727 INFO L93 Difference]: Finished difference Result 617 states and 619 transitions. [2018-09-26 08:17:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:17:55,727 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 408 [2018-09-26 08:17:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:55,728 INFO L225 Difference]: With dead ends: 617 [2018-09-26 08:17:55,728 INFO L226 Difference]: Without dead ends: 411 [2018-09-26 08:17:55,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15050 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25755, Invalid=66357, Unknown=0, NotChecked=0, Total=92112 [2018-09-26 08:17:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-09-26 08:17:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-09-26 08:17:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 08:17:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-09-26 08:17:55,764 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 408 [2018-09-26 08:17:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:55,764 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-09-26 08:17:55,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:17:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-09-26 08:17:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-26 08:17:55,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:55,765 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 1, 1, 1, 1] [2018-09-26 08:17:55,766 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:55,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash 380940247, now seen corresponding path program 152 times [2018-09-26 08:17:55,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 10302 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:57,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:57,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-09-26 08:17:57,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-09-26 08:17:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-09-26 08:17:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10608, Invalid=31212, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:17:57,272 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 205 states. [2018-09-26 08:17:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:58,945 INFO L93 Difference]: Finished difference Result 619 states and 621 transitions. [2018-09-26 08:17:58,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:17:58,945 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 410 [2018-09-26 08:17:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:58,946 INFO L225 Difference]: With dead ends: 619 [2018-09-26 08:17:58,946 INFO L226 Difference]: Without dead ends: 413 [2018-09-26 08:17:58,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26162, Invalid=67168, Unknown=0, NotChecked=0, Total=93330 [2018-09-26 08:17:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-09-26 08:17:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-09-26 08:17:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-09-26 08:17:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-09-26 08:17:58,983 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 410 [2018-09-26 08:17:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:58,983 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-09-26 08:17:58,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-09-26 08:17:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-09-26 08:17:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-09-26 08:17:58,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:58,984 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 102, 101, 1, 1, 1, 1] [2018-09-26 08:17:58,984 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:58,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -403023917, now seen corresponding path program 153 times [2018-09-26 08:17:58,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20808 backedges. 10506 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:59,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:59,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:17:59,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:17:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:17:59,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5567, Invalid=5775, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:17:59,872 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 107 states. [2018-09-26 08:18:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:00,330 INFO L93 Difference]: Finished difference Result 419 states and 421 transitions. [2018-09-26 08:18:00,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:18:00,330 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 412 [2018-09-26 08:18:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:00,331 INFO L225 Difference]: With dead ends: 419 [2018-09-26 08:18:00,331 INFO L226 Difference]: Without dead ends: 417 [2018-09-26 08:18:00,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10609 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16486, Invalid=27404, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:18:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-09-26 08:18:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-09-26 08:18:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-09-26 08:18:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-09-26 08:18:00,366 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 412 [2018-09-26 08:18:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:00,366 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-09-26 08:18:00,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:18:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-09-26 08:18:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-09-26 08:18:00,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:00,367 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 103, 102, 1, 1, 1, 1] [2018-09-26 08:18:00,367 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:00,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 865376455, now seen corresponding path program 154 times [2018-09-26 08:18:00,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21218 backedges. 10712 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:01,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:01,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:18:01,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:18:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:18:01,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10919, Invalid=32137, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:18:01,842 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 208 states. [2018-09-26 08:18:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:03,409 INFO L93 Difference]: Finished difference Result 629 states and 631 transitions. [2018-09-26 08:18:03,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:18:03,410 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 416 [2018-09-26 08:18:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:03,410 INFO L225 Difference]: With dead ends: 629 [2018-09-26 08:18:03,410 INFO L226 Difference]: Without dead ends: 419 [2018-09-26 08:18:03,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15657 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26780, Invalid=69010, Unknown=0, NotChecked=0, Total=95790 [2018-09-26 08:18:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-09-26 08:18:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-09-26 08:18:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-26 08:18:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 420 transitions. [2018-09-26 08:18:03,447 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 420 transitions. Word has length 416 [2018-09-26 08:18:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:03,447 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 420 transitions. [2018-09-26 08:18:03,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:18:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 420 transitions. [2018-09-26 08:18:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-09-26 08:18:03,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:03,449 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 103, 103, 1, 1, 1, 1] [2018-09-26 08:18:03,449 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:03,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2140974141, now seen corresponding path program 155 times [2018-09-26 08:18:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 10712 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:04,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:04,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-09-26 08:18:04,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-09-26 08:18:04,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-09-26 08:18:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11024, Invalid=32448, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:18:04,997 INFO L87 Difference]: Start difference. First operand 419 states and 420 transitions. Second operand 209 states. [2018-09-26 08:18:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:06,590 INFO L93 Difference]: Finished difference Result 631 states and 633 transitions. [2018-09-26 08:18:06,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:18:06,591 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 418 [2018-09-26 08:18:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:06,591 INFO L225 Difference]: With dead ends: 631 [2018-09-26 08:18:06,591 INFO L226 Difference]: Without dead ends: 421 [2018-09-26 08:18:06,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15760 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27195, Invalid=69837, Unknown=0, NotChecked=0, Total=97032 [2018-09-26 08:18:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-09-26 08:18:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2018-09-26 08:18:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 08:18:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-09-26 08:18:06,625 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 418 [2018-09-26 08:18:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:06,626 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-09-26 08:18:06,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-09-26 08:18:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-09-26 08:18:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-09-26 08:18:06,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:06,627 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 104, 103, 1, 1, 1, 1] [2018-09-26 08:18:06,627 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:06,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash -730906689, now seen corresponding path program 156 times [2018-09-26 08:18:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21632 backedges. 10920 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:07,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:07,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:18:07,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:18:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:18:07,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5780, Invalid=5992, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:18:07,573 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 109 states. [2018-09-26 08:18:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:08,088 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-09-26 08:18:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:18:08,088 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 420 [2018-09-26 08:18:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:08,089 INFO L225 Difference]: With dead ends: 427 [2018-09-26 08:18:08,089 INFO L226 Difference]: Without dead ends: 425 [2018-09-26 08:18:08,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11025 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17121, Invalid=28461, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:18:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-09-26 08:18:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-09-26 08:18:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-09-26 08:18:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-09-26 08:18:08,149 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 420 [2018-09-26 08:18:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:08,149 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-09-26 08:18:08,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:18:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-09-26 08:18:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-09-26 08:18:08,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:08,152 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 105, 104, 1, 1, 1, 1] [2018-09-26 08:18:08,152 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:08,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1975801165, now seen corresponding path program 157 times [2018-09-26 08:18:08,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 22050 backedges. 11130 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:09,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:09,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:18:09,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:18:09,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:18:09,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11341, Invalid=33391, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:18:09,823 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 212 states. [2018-09-26 08:18:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:11,438 INFO L93 Difference]: Finished difference Result 641 states and 643 transitions. [2018-09-26 08:18:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-09-26 08:18:11,438 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 424 [2018-09-26 08:18:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:11,438 INFO L225 Difference]: With dead ends: 641 [2018-09-26 08:18:11,439 INFO L226 Difference]: Without dead ends: 427 [2018-09-26 08:18:11,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27825, Invalid=71715, Unknown=0, NotChecked=0, Total=99540 [2018-09-26 08:18:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-09-26 08:18:11,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-09-26 08:18:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-26 08:18:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-09-26 08:18:11,476 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 424 [2018-09-26 08:18:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:11,476 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-09-26 08:18:11,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:18:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-09-26 08:18:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-09-26 08:18:11,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:11,477 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 105, 105, 1, 1, 1, 1] [2018-09-26 08:18:11,477 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:11,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash -720524881, now seen corresponding path program 158 times [2018-09-26 08:18:11,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 11130 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:13,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:13,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-09-26 08:18:13,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-09-26 08:18:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-09-26 08:18:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11448, Invalid=33708, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:18:13,073 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 213 states. [2018-09-26 08:18:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:14,781 INFO L93 Difference]: Finished difference Result 643 states and 645 transitions. [2018-09-26 08:18:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:18:14,781 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 426 [2018-09-26 08:18:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:14,782 INFO L225 Difference]: With dead ends: 643 [2018-09-26 08:18:14,782 INFO L226 Difference]: Without dead ends: 429 [2018-09-26 08:18:14,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16381 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28248, Invalid=72558, Unknown=0, NotChecked=0, Total=100806 [2018-09-26 08:18:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-09-26 08:18:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-09-26 08:18:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-09-26 08:18:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-09-26 08:18:14,821 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 426 [2018-09-26 08:18:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:14,821 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-09-26 08:18:14,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-09-26 08:18:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-09-26 08:18:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-09-26 08:18:14,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:14,823 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 106, 105, 1, 1, 1, 1] [2018-09-26 08:18:14,824 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:14,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1285826133, now seen corresponding path program 159 times [2018-09-26 08:18:14,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 22472 backedges. 11342 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:15,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:15,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:18:15,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:18:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:18:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5997, Invalid=6213, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:18:15,835 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 111 states. [2018-09-26 08:18:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:16,353 INFO L93 Difference]: Finished difference Result 435 states and 437 transitions. [2018-09-26 08:18:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:18:16,353 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 428 [2018-09-26 08:18:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:16,354 INFO L225 Difference]: With dead ends: 435 [2018-09-26 08:18:16,354 INFO L226 Difference]: Without dead ends: 433 [2018-09-26 08:18:16,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11449 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17768, Invalid=29538, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:18:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-09-26 08:18:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-09-26 08:18:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-09-26 08:18:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-09-26 08:18:16,391 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 428 [2018-09-26 08:18:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:16,391 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-09-26 08:18:16,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:18:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-09-26 08:18:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-09-26 08:18:16,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:16,392 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 107, 106, 1, 1, 1, 1] [2018-09-26 08:18:16,392 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:16,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1942917473, now seen corresponding path program 160 times [2018-09-26 08:18:16,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22898 backedges. 11556 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:18,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:18,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:18:18,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:18:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:18:18,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11771, Invalid=34669, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:18:18,060 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 216 states. [2018-09-26 08:18:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:19,792 INFO L93 Difference]: Finished difference Result 653 states and 655 transitions. [2018-09-26 08:18:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:18:19,792 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 432 [2018-09-26 08:18:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:19,793 INFO L225 Difference]: With dead ends: 653 [2018-09-26 08:18:19,793 INFO L226 Difference]: Without dead ends: 435 [2018-09-26 08:18:19,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16907 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=28890, Invalid=74472, Unknown=0, NotChecked=0, Total=103362 [2018-09-26 08:18:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-09-26 08:18:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-09-26 08:18:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-09-26 08:18:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-09-26 08:18:19,832 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 432 [2018-09-26 08:18:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:19,832 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-09-26 08:18:19,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:18:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-09-26 08:18:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-09-26 08:18:19,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:19,833 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 107, 107, 1, 1, 1, 1] [2018-09-26 08:18:19,834 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:19,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1333965211, now seen corresponding path program 161 times [2018-09-26 08:18:19,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11556 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:21,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:21,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-09-26 08:18:21,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-09-26 08:18:21,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-09-26 08:18:21,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11880, Invalid=34992, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:18:21,573 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 217 states. [2018-09-26 08:18:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:22,850 INFO L93 Difference]: Finished difference Result 655 states and 657 transitions. [2018-09-26 08:18:22,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:18:22,850 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 434 [2018-09-26 08:18:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:22,850 INFO L225 Difference]: With dead ends: 655 [2018-09-26 08:18:22,851 INFO L226 Difference]: Without dead ends: 437 [2018-09-26 08:18:22,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17014 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=29321, Invalid=75331, Unknown=0, NotChecked=0, Total=104652 [2018-09-26 08:18:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-09-26 08:18:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-09-26 08:18:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-09-26 08:18:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-09-26 08:18:22,889 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 434 [2018-09-26 08:18:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:22,890 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-09-26 08:18:22,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-09-26 08:18:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-09-26 08:18:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-09-26 08:18:22,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:22,891 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 108, 107, 1, 1, 1, 1] [2018-09-26 08:18:22,891 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:22,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2087770729, now seen corresponding path program 162 times [2018-09-26 08:18:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 23328 backedges. 11772 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:23,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:23,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:18:23,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:18:23,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:18:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6218, Invalid=6438, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:18:23,969 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 113 states. [2018-09-26 08:18:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:24,514 INFO L93 Difference]: Finished difference Result 443 states and 445 transitions. [2018-09-26 08:18:24,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-09-26 08:18:24,514 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 436 [2018-09-26 08:18:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:24,515 INFO L225 Difference]: With dead ends: 443 [2018-09-26 08:18:24,515 INFO L226 Difference]: Without dead ends: 441 [2018-09-26 08:18:24,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11881 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18427, Invalid=30635, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:18:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-09-26 08:18:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2018-09-26 08:18:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-09-26 08:18:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-09-26 08:18:24,554 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 436 [2018-09-26 08:18:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:24,554 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-09-26 08:18:24,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:18:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-09-26 08:18:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-09-26 08:18:24,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:24,556 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 109, 108, 1, 1, 1, 1] [2018-09-26 08:18:24,556 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:24,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 952427659, now seen corresponding path program 163 times [2018-09-26 08:18:24,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 23762 backedges. 11990 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:26,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:26,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-09-26 08:18:26,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-09-26 08:18:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-09-26 08:18:26,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12209, Invalid=35971, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:18:26,386 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 220 states. [2018-09-26 08:18:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:28,142 INFO L93 Difference]: Finished difference Result 665 states and 667 transitions. [2018-09-26 08:18:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-09-26 08:18:28,142 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 440 [2018-09-26 08:18:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:28,143 INFO L225 Difference]: With dead ends: 665 [2018-09-26 08:18:28,143 INFO L226 Difference]: Without dead ends: 443 [2018-09-26 08:18:28,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17550 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=29975, Invalid=77281, Unknown=0, NotChecked=0, Total=107256 [2018-09-26 08:18:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-09-26 08:18:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-09-26 08:18:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-09-26 08:18:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 444 transitions. [2018-09-26 08:18:28,189 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 444 transitions. Word has length 440 [2018-09-26 08:18:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:28,189 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 444 transitions. [2018-09-26 08:18:28,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-09-26 08:18:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 444 transitions. [2018-09-26 08:18:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-09-26 08:18:28,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:28,191 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 1, 1, 1, 1] [2018-09-26 08:18:28,191 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:28,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1290703993, now seen corresponding path program 164 times [2018-09-26 08:18:28,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11990 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:30,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:30,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-09-26 08:18:30,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-09-26 08:18:30,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-09-26 08:18:30,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12320, Invalid=36300, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:18:30,139 INFO L87 Difference]: Start difference. First operand 443 states and 444 transitions. Second operand 221 states. [2018-09-26 08:18:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:31,905 INFO L93 Difference]: Finished difference Result 667 states and 669 transitions. [2018-09-26 08:18:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-09-26 08:18:31,905 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 442 [2018-09-26 08:18:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:31,906 INFO L225 Difference]: With dead ends: 667 [2018-09-26 08:18:31,906 INFO L226 Difference]: Without dead ends: 445 [2018-09-26 08:18:31,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17659 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=30414, Invalid=78156, Unknown=0, NotChecked=0, Total=108570 [2018-09-26 08:18:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-09-26 08:18:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-09-26 08:18:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-26 08:18:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 446 transitions. [2018-09-26 08:18:31,950 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 446 transitions. Word has length 442 [2018-09-26 08:18:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:31,950 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 446 transitions. [2018-09-26 08:18:31,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-09-26 08:18:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 446 transitions. [2018-09-26 08:18:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-09-26 08:18:31,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:31,952 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 110, 109, 1, 1, 1, 1] [2018-09-26 08:18:31,952 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:31,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash -866638973, now seen corresponding path program 165 times [2018-09-26 08:18:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24200 backedges. 12210 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:33,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:33,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:18:33,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:18:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:18:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6443, Invalid=6667, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:18:33,144 INFO L87 Difference]: Start difference. First operand 445 states and 446 transitions. Second operand 115 states. [2018-09-26 08:18:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:33,698 INFO L93 Difference]: Finished difference Result 451 states and 453 transitions. [2018-09-26 08:18:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-09-26 08:18:33,698 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 444 [2018-09-26 08:18:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:33,699 INFO L225 Difference]: With dead ends: 451 [2018-09-26 08:18:33,699 INFO L226 Difference]: Without dead ends: 449 [2018-09-26 08:18:33,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12321 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19098, Invalid=31752, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:18:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-09-26 08:18:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-09-26 08:18:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-09-26 08:18:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-09-26 08:18:33,740 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 444 [2018-09-26 08:18:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:33,740 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-09-26 08:18:33,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:18:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-09-26 08:18:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-09-26 08:18:33,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:33,742 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 111, 110, 1, 1, 1, 1] [2018-09-26 08:18:33,742 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:33,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash -674952073, now seen corresponding path program 166 times [2018-09-26 08:18:33,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 24642 backedges. 12432 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:35,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:35,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-09-26 08:18:35,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-09-26 08:18:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-09-26 08:18:35,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12655, Invalid=37297, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:18:35,562 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 224 states. [2018-09-26 08:18:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:37,104 INFO L93 Difference]: Finished difference Result 677 states and 679 transitions. [2018-09-26 08:18:37,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-09-26 08:18:37,105 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 448 [2018-09-26 08:18:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:37,105 INFO L225 Difference]: With dead ends: 677 [2018-09-26 08:18:37,105 INFO L226 Difference]: Without dead ends: 451 [2018-09-26 08:18:37,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31080, Invalid=80142, Unknown=0, NotChecked=0, Total=111222 [2018-09-26 08:18:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-09-26 08:18:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2018-09-26 08:18:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-09-26 08:18:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 452 transitions. [2018-09-26 08:18:37,147 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 452 transitions. Word has length 448 [2018-09-26 08:18:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:37,147 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 452 transitions. [2018-09-26 08:18:37,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-09-26 08:18:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 452 transitions. [2018-09-26 08:18:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-09-26 08:18:37,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:37,149 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 111, 111, 1, 1, 1, 1] [2018-09-26 08:18:37,149 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:37,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash 193517427, now seen corresponding path program 167 times [2018-09-26 08:18:37,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 12432 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:39,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:39,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224] total 224 [2018-09-26 08:18:39,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-09-26 08:18:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-09-26 08:18:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12768, Invalid=37632, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:18:39,038 INFO L87 Difference]: Start difference. First operand 451 states and 452 transitions. Second operand 225 states. [2018-09-26 08:18:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:40,500 INFO L93 Difference]: Finished difference Result 679 states and 681 transitions. [2018-09-26 08:18:40,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-09-26 08:18:40,500 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 450 [2018-09-26 08:18:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:40,501 INFO L225 Difference]: With dead ends: 679 [2018-09-26 08:18:40,501 INFO L226 Difference]: Without dead ends: 453 [2018-09-26 08:18:40,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18316 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31527, Invalid=81033, Unknown=0, NotChecked=0, Total=112560 [2018-09-26 08:18:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-09-26 08:18:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-09-26 08:18:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-09-26 08:18:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 454 transitions. [2018-09-26 08:18:40,541 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 454 transitions. Word has length 450 [2018-09-26 08:18:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:40,541 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 454 transitions. [2018-09-26 08:18:40,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-09-26 08:18:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 454 transitions. [2018-09-26 08:18:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-09-26 08:18:40,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:40,543 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 112, 111, 1, 1, 1, 1] [2018-09-26 08:18:40,544 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:40,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:40,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1569051503, now seen corresponding path program 168 times [2018-09-26 08:18:40,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 25088 backedges. 12656 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:41,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:41,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:18:41,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:18:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:18:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6672, Invalid=6900, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:18:41,794 INFO L87 Difference]: Start difference. First operand 453 states and 454 transitions. Second operand 117 states. [2018-09-26 08:18:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:42,370 INFO L93 Difference]: Finished difference Result 459 states and 461 transitions. [2018-09-26 08:18:42,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-09-26 08:18:42,370 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 452 [2018-09-26 08:18:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:42,371 INFO L225 Difference]: With dead ends: 459 [2018-09-26 08:18:42,371 INFO L226 Difference]: Without dead ends: 457 [2018-09-26 08:18:42,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12769 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19781, Invalid=32889, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:18:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-09-26 08:18:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2018-09-26 08:18:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-09-26 08:18:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-09-26 08:18:42,412 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 452 [2018-09-26 08:18:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:42,413 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-09-26 08:18:42,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:18:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-09-26 08:18:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-09-26 08:18:42,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:42,414 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 113, 112, 1, 1, 1, 1] [2018-09-26 08:18:42,414 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:42,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1182734749, now seen corresponding path program 169 times [2018-09-26 08:18:42,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25538 backedges. 12882 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:44,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:44,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-09-26 08:18:44,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-09-26 08:18:44,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-09-26 08:18:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13109, Invalid=38647, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:18:44,319 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 228 states. [2018-09-26 08:18:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:45,805 INFO L93 Difference]: Finished difference Result 689 states and 691 transitions. [2018-09-26 08:18:45,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-09-26 08:18:45,806 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 456 [2018-09-26 08:18:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:45,806 INFO L225 Difference]: With dead ends: 689 [2018-09-26 08:18:45,806 INFO L226 Difference]: Without dead ends: 459 [2018-09-26 08:18:45,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18872 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=32205, Invalid=83055, Unknown=0, NotChecked=0, Total=115260 [2018-09-26 08:18:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-26 08:18:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2018-09-26 08:18:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-09-26 08:18:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 460 transitions. [2018-09-26 08:18:45,850 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 460 transitions. Word has length 456 [2018-09-26 08:18:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:45,851 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 460 transitions. [2018-09-26 08:18:45,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-09-26 08:18:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 460 transitions. [2018-09-26 08:18:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-09-26 08:18:45,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:45,852 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 113, 113, 1, 1, 1, 1] [2018-09-26 08:18:45,852 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:45,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1832383839, now seen corresponding path program 170 times [2018-09-26 08:18:45,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 12882 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:47,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:47,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [228] total 228 [2018-09-26 08:18:47,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 229 states [2018-09-26 08:18:47,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2018-09-26 08:18:47,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13224, Invalid=38988, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:18:47,796 INFO L87 Difference]: Start difference. First operand 459 states and 460 transitions. Second operand 229 states. [2018-09-26 08:18:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:49,432 INFO L93 Difference]: Finished difference Result 691 states and 693 transitions. [2018-09-26 08:18:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-09-26 08:18:49,432 INFO L78 Accepts]: Start accepts. Automaton has 229 states. Word has length 458 [2018-09-26 08:18:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:49,433 INFO L225 Difference]: With dead ends: 691 [2018-09-26 08:18:49,433 INFO L226 Difference]: Without dead ends: 461 [2018-09-26 08:18:49,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18985 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=32660, Invalid=83962, Unknown=0, NotChecked=0, Total=116622 [2018-09-26 08:18:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-09-26 08:18:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2018-09-26 08:18:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-09-26 08:18:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 462 transitions. [2018-09-26 08:18:49,476 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 462 transitions. Word has length 458 [2018-09-26 08:18:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:49,477 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 462 transitions. [2018-09-26 08:18:49,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 229 states. [2018-09-26 08:18:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 462 transitions. [2018-09-26 08:18:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-09-26 08:18:49,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:49,478 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 114, 113, 1, 1, 1, 1] [2018-09-26 08:18:49,478 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:49,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:49,479 INFO L82 PathProgramCache]: Analyzing trace with hash 258422107, now seen corresponding path program 171 times [2018-09-26 08:18:49,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25992 backedges. 13110 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:50,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:50,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:18:50,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:18:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:18:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6905, Invalid=7137, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:18:50,720 INFO L87 Difference]: Start difference. First operand 461 states and 462 transitions. Second operand 119 states. [2018-09-26 08:18:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:51,317 INFO L93 Difference]: Finished difference Result 467 states and 469 transitions. [2018-09-26 08:18:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-09-26 08:18:51,317 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 460 [2018-09-26 08:18:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:51,318 INFO L225 Difference]: With dead ends: 467 [2018-09-26 08:18:51,318 INFO L226 Difference]: Without dead ends: 465 [2018-09-26 08:18:51,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20476, Invalid=34046, Unknown=0, NotChecked=0, Total=54522 [2018-09-26 08:18:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-09-26 08:18:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2018-09-26 08:18:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-09-26 08:18:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 466 transitions. [2018-09-26 08:18:51,359 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 466 transitions. Word has length 460 [2018-09-26 08:18:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:51,359 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 466 transitions. [2018-09-26 08:18:51,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:18:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 466 transitions. [2018-09-26 08:18:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-09-26 08:18:51,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:51,361 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 115, 114, 1, 1, 1, 1] [2018-09-26 08:18:51,361 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:51,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash -154701233, now seen corresponding path program 172 times [2018-09-26 08:18:51,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26450 backedges. 13340 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:53,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:53,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [231] total 231 [2018-09-26 08:18:53,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 232 states [2018-09-26 08:18:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 232 interpolants. [2018-09-26 08:18:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13571, Invalid=40021, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:18:53,306 INFO L87 Difference]: Start difference. First operand 465 states and 466 transitions. Second operand 232 states. [2018-09-26 08:18:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:55,281 INFO L93 Difference]: Finished difference Result 701 states and 703 transitions. [2018-09-26 08:18:55,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-09-26 08:18:55,281 INFO L78 Accepts]: Start accepts. Automaton has 232 states. Word has length 464 [2018-09-26 08:18:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:55,282 INFO L225 Difference]: With dead ends: 701 [2018-09-26 08:18:55,282 INFO L226 Difference]: Without dead ends: 467 [2018-09-26 08:18:55,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19551 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=33350, Invalid=86020, Unknown=0, NotChecked=0, Total=119370 [2018-09-26 08:18:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-09-26 08:18:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2018-09-26 08:18:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-09-26 08:18:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-09-26 08:18:55,325 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 464 [2018-09-26 08:18:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:55,325 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-09-26 08:18:55,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 232 states. [2018-09-26 08:18:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-09-26 08:18:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-09-26 08:18:55,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:55,327 INFO L375 BasicCegarLoop]: trace histogram [116, 116, 115, 115, 1, 1, 1, 1] [2018-09-26 08:18:55,327 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:55,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:55,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1259485877, now seen corresponding path program 173 times [2018-09-26 08:18:55,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:57,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 13340 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:57,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:57,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [232] total 232 [2018-09-26 08:18:57,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 233 states [2018-09-26 08:18:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2018-09-26 08:18:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13688, Invalid=40368, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:18:57,289 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 233 states. [2018-09-26 08:18:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:59,195 INFO L93 Difference]: Finished difference Result 703 states and 705 transitions. [2018-09-26 08:18:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-09-26 08:18:59,196 INFO L78 Accepts]: Start accepts. Automaton has 233 states. Word has length 466 [2018-09-26 08:18:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:59,196 INFO L225 Difference]: With dead ends: 703 [2018-09-26 08:18:59,196 INFO L226 Difference]: Without dead ends: 469 [2018-09-26 08:18:59,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=33813, Invalid=86943, Unknown=0, NotChecked=0, Total=120756 [2018-09-26 08:18:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-09-26 08:18:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2018-09-26 08:18:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-09-26 08:18:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 470 transitions. [2018-09-26 08:18:59,241 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 470 transitions. Word has length 466 [2018-09-26 08:18:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:59,242 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 470 transitions. [2018-09-26 08:18:59,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 233 states. [2018-09-26 08:18:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 470 transitions. [2018-09-26 08:18:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-09-26 08:18:59,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:59,243 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 116, 115, 1, 1, 1, 1] [2018-09-26 08:18:59,243 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:59,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2100606649, now seen corresponding path program 174 times [2018-09-26 08:18:59,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26912 backedges. 13572 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:00,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:00,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:19:00,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:19:00,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:19:00,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7142, Invalid=7378, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:19:00,490 INFO L87 Difference]: Start difference. First operand 469 states and 470 transitions. Second operand 121 states. [2018-09-26 08:19:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:01,194 INFO L93 Difference]: Finished difference Result 475 states and 477 transitions. [2018-09-26 08:19:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2018-09-26 08:19:01,195 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 468 [2018-09-26 08:19:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:01,196 INFO L225 Difference]: With dead ends: 475 [2018-09-26 08:19:01,196 INFO L226 Difference]: Without dead ends: 473 [2018-09-26 08:19:01,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13689 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21183, Invalid=35223, Unknown=0, NotChecked=0, Total=56406 [2018-09-26 08:19:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-09-26 08:19:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2018-09-26 08:19:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-26 08:19:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 474 transitions. [2018-09-26 08:19:01,256 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 474 transitions. Word has length 468 [2018-09-26 08:19:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:01,257 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 474 transitions. [2018-09-26 08:19:01,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:19:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 474 transitions. [2018-09-26 08:19:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-09-26 08:19:01,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:01,259 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 117, 116, 1, 1, 1, 1] [2018-09-26 08:19:01,259 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:01,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 820490299, now seen corresponding path program 175 times [2018-09-26 08:19:01,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 27378 backedges. 13806 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:03,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:03,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [235] total 235 [2018-09-26 08:19:03,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 236 states [2018-09-26 08:19:03,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 236 interpolants. [2018-09-26 08:19:03,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14041, Invalid=41419, Unknown=0, NotChecked=0, Total=55460 [2018-09-26 08:19:03,271 INFO L87 Difference]: Start difference. First operand 473 states and 474 transitions. Second operand 236 states. [2018-09-26 08:19:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:05,090 INFO L93 Difference]: Finished difference Result 713 states and 715 transitions. [2018-09-26 08:19:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-09-26 08:19:05,090 INFO L78 Accepts]: Start accepts. Automaton has 236 states. Word has length 472 [2018-09-26 08:19:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:05,091 INFO L225 Difference]: With dead ends: 713 [2018-09-26 08:19:05,091 INFO L226 Difference]: Without dead ends: 475 [2018-09-26 08:19:05,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20242 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=34515, Invalid=89037, Unknown=0, NotChecked=0, Total=123552 [2018-09-26 08:19:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-09-26 08:19:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2018-09-26 08:19:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-09-26 08:19:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 476 transitions. [2018-09-26 08:19:05,139 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 476 transitions. Word has length 472 [2018-09-26 08:19:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:05,139 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 476 transitions. [2018-09-26 08:19:05,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 236 states. [2018-09-26 08:19:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 476 transitions. [2018-09-26 08:19:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-09-26 08:19:05,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:05,141 INFO L375 BasicCegarLoop]: trace histogram [118, 118, 117, 117, 1, 1, 1, 1] [2018-09-26 08:19:05,141 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:05,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1207519031, now seen corresponding path program 176 times [2018-09-26 08:19:05,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 13806 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:07,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:07,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [236] total 236 [2018-09-26 08:19:07,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 237 states [2018-09-26 08:19:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2018-09-26 08:19:07,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14160, Invalid=41772, Unknown=0, NotChecked=0, Total=55932 [2018-09-26 08:19:07,147 INFO L87 Difference]: Start difference. First operand 475 states and 476 transitions. Second operand 237 states. [2018-09-26 08:19:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:08,812 INFO L93 Difference]: Finished difference Result 715 states and 717 transitions. [2018-09-26 08:19:08,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2018-09-26 08:19:08,812 INFO L78 Accepts]: Start accepts. Automaton has 237 states. Word has length 474 [2018-09-26 08:19:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:08,813 INFO L225 Difference]: With dead ends: 715 [2018-09-26 08:19:08,813 INFO L226 Difference]: Without dead ends: 477 [2018-09-26 08:19:08,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20359 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=34986, Invalid=89976, Unknown=0, NotChecked=0, Total=124962 [2018-09-26 08:19:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-09-26 08:19:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-09-26 08:19:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-09-26 08:19:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 478 transitions. [2018-09-26 08:19:08,860 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 478 transitions. Word has length 474 [2018-09-26 08:19:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:08,860 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 478 transitions. [2018-09-26 08:19:08,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 237 states. [2018-09-26 08:19:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 478 transitions. [2018-09-26 08:19:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-09-26 08:19:08,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:08,862 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 118, 117, 1, 1, 1, 1] [2018-09-26 08:19:08,862 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:08,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -520024269, now seen corresponding path program 177 times [2018-09-26 08:19:08,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 27848 backedges. 14042 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:10,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:10,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:19:10,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:19:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:19:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7383, Invalid=7623, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:19:10,096 INFO L87 Difference]: Start difference. First operand 477 states and 478 transitions. Second operand 123 states. [2018-09-26 08:19:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:10,777 INFO L93 Difference]: Finished difference Result 483 states and 485 transitions. [2018-09-26 08:19:10,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-09-26 08:19:10,777 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 476 [2018-09-26 08:19:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:10,778 INFO L225 Difference]: With dead ends: 483 [2018-09-26 08:19:10,778 INFO L226 Difference]: Without dead ends: 481 [2018-09-26 08:19:10,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21902, Invalid=36420, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:19:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-26 08:19:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2018-09-26 08:19:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-09-26 08:19:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 482 transitions. [2018-09-26 08:19:10,822 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 482 transitions. Word has length 476 [2018-09-26 08:19:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:10,822 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 482 transitions. [2018-09-26 08:19:10,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:19:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 482 transitions. [2018-09-26 08:19:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-09-26 08:19:10,824 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:10,824 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 119, 118, 1, 1, 1, 1] [2018-09-26 08:19:10,824 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:10,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:10,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1370529831, now seen corresponding path program 178 times [2018-09-26 08:19:10,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 28322 backedges. 14280 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:13,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:13,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [239] total 239 [2018-09-26 08:19:13,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 240 states [2018-09-26 08:19:13,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 240 interpolants. [2018-09-26 08:19:13,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14519, Invalid=42841, Unknown=0, NotChecked=0, Total=57360 [2018-09-26 08:19:13,154 INFO L87 Difference]: Start difference. First operand 481 states and 482 transitions. Second operand 240 states. [2018-09-26 08:19:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:14,988 INFO L93 Difference]: Finished difference Result 725 states and 727 transitions. [2018-09-26 08:19:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-09-26 08:19:14,989 INFO L78 Accepts]: Start accepts. Automaton has 240 states. Word has length 480 [2018-09-26 08:19:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:14,989 INFO L225 Difference]: With dead ends: 725 [2018-09-26 08:19:14,989 INFO L226 Difference]: Without dead ends: 483 [2018-09-26 08:19:14,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20945 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=35700, Invalid=92106, Unknown=0, NotChecked=0, Total=127806 [2018-09-26 08:19:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-09-26 08:19:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2018-09-26 08:19:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-09-26 08:19:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 484 transitions. [2018-09-26 08:19:15,037 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 484 transitions. Word has length 480 [2018-09-26 08:19:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:15,037 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 484 transitions. [2018-09-26 08:19:15,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 240 states. [2018-09-26 08:19:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 484 transitions. [2018-09-26 08:19:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-09-26 08:19:15,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:15,039 INFO L375 BasicCegarLoop]: trace histogram [120, 120, 119, 119, 1, 1, 1, 1] [2018-09-26 08:19:15,039 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:15,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash -735479005, now seen corresponding path program 179 times [2018-09-26 08:19:15,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 14280 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:17,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:17,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [240] total 240 [2018-09-26 08:19:17,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 241 states [2018-09-26 08:19:17,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2018-09-26 08:19:17,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14640, Invalid=43200, Unknown=0, NotChecked=0, Total=57840 [2018-09-26 08:19:17,261 INFO L87 Difference]: Start difference. First operand 483 states and 484 transitions. Second operand 241 states. [2018-09-26 08:19:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:19,219 INFO L93 Difference]: Finished difference Result 727 states and 729 transitions. [2018-09-26 08:19:19,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-09-26 08:19:19,219 INFO L78 Accepts]: Start accepts. Automaton has 241 states. Word has length 482 [2018-09-26 08:19:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:19,220 INFO L225 Difference]: With dead ends: 727 [2018-09-26 08:19:19,220 INFO L226 Difference]: Without dead ends: 485 [2018-09-26 08:19:19,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21064 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=36179, Invalid=93061, Unknown=0, NotChecked=0, Total=129240 [2018-09-26 08:19:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-09-26 08:19:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2018-09-26 08:19:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-09-26 08:19:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-09-26 08:19:19,267 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 482 [2018-09-26 08:19:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:19,268 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-09-26 08:19:19,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 241 states. [2018-09-26 08:19:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-09-26 08:19:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-09-26 08:19:19,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:19,269 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 120, 119, 1, 1, 1, 1] [2018-09-26 08:19:19,270 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:19,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:19,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1680373985, now seen corresponding path program 180 times [2018-09-26 08:19:19,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 28800 backedges. 14520 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:20,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:20,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:19:20,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:19:20,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:19:20,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7628, Invalid=7872, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:19:20,766 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 125 states. [2018-09-26 08:19:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:21,537 INFO L93 Difference]: Finished difference Result 491 states and 493 transitions. [2018-09-26 08:19:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2018-09-26 08:19:21,537 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 484 [2018-09-26 08:19:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:21,538 INFO L225 Difference]: With dead ends: 491 [2018-09-26 08:19:21,538 INFO L226 Difference]: Without dead ends: 489 [2018-09-26 08:19:21,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14641 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22633, Invalid=37637, Unknown=0, NotChecked=0, Total=60270 [2018-09-26 08:19:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-09-26 08:19:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2018-09-26 08:19:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-09-26 08:19:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-09-26 08:19:21,583 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 484 [2018-09-26 08:19:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:21,583 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-09-26 08:19:21,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:19:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-09-26 08:19:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-09-26 08:19:21,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:21,585 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 121, 120, 1, 1, 1, 1] [2018-09-26 08:19:21,585 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:21,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1265713683, now seen corresponding path program 181 times [2018-09-26 08:19:21,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29282 backedges. 14762 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:23,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:23,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [243] total 243 [2018-09-26 08:19:23,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 244 states [2018-09-26 08:19:23,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2018-09-26 08:19:23,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15005, Invalid=44287, Unknown=0, NotChecked=0, Total=59292 [2018-09-26 08:19:23,930 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 244 states. [2018-09-26 08:19:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:25,617 INFO L93 Difference]: Finished difference Result 737 states and 739 transitions. [2018-09-26 08:19:25,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-09-26 08:19:25,617 INFO L78 Accepts]: Start accepts. Automaton has 244 states. Word has length 488 [2018-09-26 08:19:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:25,618 INFO L225 Difference]: With dead ends: 737 [2018-09-26 08:19:25,618 INFO L226 Difference]: Without dead ends: 491 [2018-09-26 08:19:25,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21660 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=36905, Invalid=95227, Unknown=0, NotChecked=0, Total=132132 [2018-09-26 08:19:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-09-26 08:19:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2018-09-26 08:19:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-09-26 08:19:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 492 transitions. [2018-09-26 08:19:25,666 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 492 transitions. Word has length 488 [2018-09-26 08:19:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:25,666 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 492 transitions. [2018-09-26 08:19:25,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 244 states. [2018-09-26 08:19:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 492 transitions. [2018-09-26 08:19:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-09-26 08:19:25,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:25,668 INFO L375 BasicCegarLoop]: trace histogram [122, 122, 121, 121, 1, 1, 1, 1] [2018-09-26 08:19:25,668 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:25,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash 265117967, now seen corresponding path program 182 times [2018-09-26 08:19:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 14762 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:28,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:28,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [244] total 244 [2018-09-26 08:19:28,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 245 states [2018-09-26 08:19:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2018-09-26 08:19:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15128, Invalid=44652, Unknown=0, NotChecked=0, Total=59780 [2018-09-26 08:19:28,063 INFO L87 Difference]: Start difference. First operand 491 states and 492 transitions. Second operand 245 states. [2018-09-26 08:19:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:30,221 INFO L93 Difference]: Finished difference Result 739 states and 741 transitions. [2018-09-26 08:19:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2018-09-26 08:19:30,222 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 490 [2018-09-26 08:19:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:30,222 INFO L225 Difference]: With dead ends: 739 [2018-09-26 08:19:30,222 INFO L226 Difference]: Without dead ends: 493 [2018-09-26 08:19:30,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21781 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=37392, Invalid=96198, Unknown=0, NotChecked=0, Total=133590 [2018-09-26 08:19:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-09-26 08:19:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-09-26 08:19:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-09-26 08:19:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 494 transitions. [2018-09-26 08:19:30,271 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 494 transitions. Word has length 490 [2018-09-26 08:19:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:30,271 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 494 transitions. [2018-09-26 08:19:30,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 245 states. [2018-09-26 08:19:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 494 transitions. [2018-09-26 08:19:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-09-26 08:19:30,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:30,273 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 122, 121, 1, 1, 1, 1] [2018-09-26 08:19:30,273 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:30,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:30,273 INFO L82 PathProgramCache]: Analyzing trace with hash 765309195, now seen corresponding path program 183 times [2018-09-26 08:19:30,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29768 backedges. 15006 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:31,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:31,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:19:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:19:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:19:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7877, Invalid=8125, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:19:31,775 INFO L87 Difference]: Start difference. First operand 493 states and 494 transitions. Second operand 127 states. [2018-09-26 08:19:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:32,508 INFO L93 Difference]: Finished difference Result 499 states and 501 transitions. [2018-09-26 08:19:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-09-26 08:19:32,508 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 492 [2018-09-26 08:19:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:32,509 INFO L225 Difference]: With dead ends: 499 [2018-09-26 08:19:32,509 INFO L226 Difference]: Without dead ends: 497 [2018-09-26 08:19:32,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23376, Invalid=38874, Unknown=0, NotChecked=0, Total=62250 [2018-09-26 08:19:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-09-26 08:19:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2018-09-26 08:19:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-09-26 08:19:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-09-26 08:19:32,555 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 492 [2018-09-26 08:19:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:32,555 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-09-26 08:19:32,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:19:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-09-26 08:19:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-09-26 08:19:32,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:32,557 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 123, 122, 1, 1, 1, 1] [2018-09-26 08:19:32,557 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:32,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash -654797313, now seen corresponding path program 184 times [2018-09-26 08:19:32,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30258 backedges. 15252 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:34,984 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:34,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [247] total 247 [2018-09-26 08:19:34,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 248 states [2018-09-26 08:19:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2018-09-26 08:19:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15499, Invalid=45757, Unknown=0, NotChecked=0, Total=61256 [2018-09-26 08:19:34,987 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 248 states. [2018-09-26 08:19:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:36,835 INFO L93 Difference]: Finished difference Result 749 states and 751 transitions. [2018-09-26 08:19:36,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2018-09-26 08:19:36,835 INFO L78 Accepts]: Start accepts. Automaton has 248 states. Word has length 496 [2018-09-26 08:19:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:36,836 INFO L225 Difference]: With dead ends: 749 [2018-09-26 08:19:36,836 INFO L226 Difference]: Without dead ends: 499 [2018-09-26 08:19:36,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22387 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=38130, Invalid=98400, Unknown=0, NotChecked=0, Total=136530 [2018-09-26 08:19:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-09-26 08:19:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-09-26 08:19:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-09-26 08:19:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 500 transitions. [2018-09-26 08:19:36,885 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 500 transitions. Word has length 496 [2018-09-26 08:19:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:36,885 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 500 transitions. [2018-09-26 08:19:36,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 248 states. [2018-09-26 08:19:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 500 transitions. [2018-09-26 08:19:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-09-26 08:19:36,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:36,887 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 123, 123, 1, 1, 1, 1] [2018-09-26 08:19:36,887 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:36,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2041837819, now seen corresponding path program 185 times [2018-09-26 08:19:36,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30504 backedges. 15252 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:39,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:39,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [248] total 248 [2018-09-26 08:19:39,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 249 states [2018-09-26 08:19:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 249 interpolants. [2018-09-26 08:19:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15624, Invalid=46128, Unknown=0, NotChecked=0, Total=61752 [2018-09-26 08:19:39,420 INFO L87 Difference]: Start difference. First operand 499 states and 500 transitions. Second operand 249 states. [2018-09-26 08:19:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,485 INFO L93 Difference]: Finished difference Result 751 states and 753 transitions. [2018-09-26 08:19:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-09-26 08:19:41,485 INFO L78 Accepts]: Start accepts. Automaton has 249 states. Word has length 498 [2018-09-26 08:19:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,486 INFO L225 Difference]: With dead ends: 751 [2018-09-26 08:19:41,486 INFO L226 Difference]: Without dead ends: 501 [2018-09-26 08:19:41,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22510 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=38625, Invalid=99387, Unknown=0, NotChecked=0, Total=138012 [2018-09-26 08:19:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-09-26 08:19:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2018-09-26 08:19:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-09-26 08:19:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 502 transitions. [2018-09-26 08:19:41,536 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 502 transitions. Word has length 498 [2018-09-26 08:19:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,537 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 502 transitions. [2018-09-26 08:19:41,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 249 states. [2018-09-26 08:19:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 502 transitions. [2018-09-26 08:19:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-09-26 08:19:41,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,538 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 124, 123, 1, 1, 1, 1] [2018-09-26 08:19:41,538 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash -652047113, now seen corresponding path program 186 times [2018-09-26 08:19:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 30752 backedges. 15500 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:43,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:43,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:19:43,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:19:43,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:19:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8130, Invalid=8382, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:19:43,217 INFO L87 Difference]: Start difference. First operand 501 states and 502 transitions. Second operand 129 states. [2018-09-26 08:19:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,948 INFO L93 Difference]: Finished difference Result 507 states and 509 transitions. [2018-09-26 08:19:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2018-09-26 08:19:43,948 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 500 [2018-09-26 08:19:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,949 INFO L225 Difference]: With dead ends: 507 [2018-09-26 08:19:43,949 INFO L226 Difference]: Without dead ends: 505 [2018-09-26 08:19:43,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15625 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24131, Invalid=40131, Unknown=0, NotChecked=0, Total=64262 [2018-09-26 08:19:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-26 08:19:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2018-09-26 08:19:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-26 08:19:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 506 transitions. [2018-09-26 08:19:43,998 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 506 transitions. Word has length 500 [2018-09-26 08:19:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,998 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 506 transitions. [2018-09-26 08:19:43,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:19:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 506 transitions. [2018-09-26 08:19:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-09-26 08:19:44,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,000 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 125, 124, 1, 1, 1, 1] [2018-09-26 08:19:44,000 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1033214955, now seen corresponding path program 187 times [2018-09-26 08:19:44,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:19:44,949 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,950 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,950 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,950 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,950 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,951 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,951 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,951 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,951 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,951 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,952 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,952 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,952 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,952 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,952 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,953 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,953 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,953 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,953 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,953 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,954 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,954 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,954 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,954 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,955 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,955 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,955 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,955 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,955 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,956 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,956 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,956 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,956 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,957 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,957 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,957 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,957 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,957 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,958 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,958 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,958 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,958 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,959 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,959 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,959 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,959 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,960 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,960 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,960 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,960 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,960 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,961 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,961 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,961 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,965 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,965 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,965 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,965 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,966 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,966 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,966 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,966 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,967 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,967 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,967 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,967 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,967 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,968 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,968 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,968 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,968 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,968 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,969 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,969 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,969 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,969 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,970 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,970 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,970 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,970 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,971 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,971 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,971 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,971 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,971 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,972 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,972 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,972 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,972 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,972 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,973 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,973 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,973 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,973 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,975 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,975 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,975 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,975 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,976 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,976 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,976 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,976 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,976 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,977 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,977 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,977 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,977 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,977 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,979 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,979 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,979 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,979 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,979 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,980 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,980 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,980 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,980 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,980 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,981 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,981 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,981 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,981 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,982 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,982 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,982 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,982 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,983 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,983 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,983 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,983 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,983 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,984 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,984 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,984 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,984 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,984 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,985 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,985 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,985 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,985 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,986 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,986 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,986 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,986 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,987 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,987 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,987 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,987 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,988 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,988 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,988 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,988 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,988 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,989 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,989 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,989 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,989 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,990 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,990 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,990 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,990 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,990 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,991 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,991 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,991 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,991 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,991 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,992 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,992 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,992 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,992 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,992 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,993 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,993 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,993 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,993 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,994 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,994 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,994 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,994 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,994 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,995 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,995 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,995 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,995 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,995 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,996 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,996 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,996 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,996 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,996 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,997 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,997 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,997 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,997 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,998 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,998 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,998 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,998 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,998 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,999 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,999 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,999 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:44,999 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,000 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,000 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,000 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,000 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,000 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,001 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,001 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,001 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,001 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,001 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,002 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,002 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,002 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,002 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,003 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,003 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,003 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,003 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,003 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,004 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,005 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,005 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,005 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,005 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,006 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,007 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,008 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,009 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,010 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,011 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,012 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,013 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,014 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,014 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,014 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,014 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,014 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,015 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,015 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,015 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,015 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,015 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,016 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,016 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,016 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,016 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,017 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,017 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,017 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,018 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,018 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,018 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,019 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,019 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,020 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,020 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,020 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,020 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,021 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,021 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,021 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,021 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,021 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,022 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,022 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,022 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,022 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,022 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,023 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,023 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,023 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,023 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,023 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,023 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,024 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,024 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,024 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,024 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,024 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,025 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,025 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,025 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,025 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,025 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,026 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,026 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,026 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,026 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,026 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,027 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,027 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,027 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,027 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,027 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,027 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,028 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,028 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,028 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,028 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,028 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,028 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,029 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,029 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,029 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,029 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,029 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,029 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,030 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,030 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,030 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,030 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,030 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,030 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,030 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,031 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,031 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,031 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,031 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,031 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,031 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,032 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,032 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,032 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,032 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,032 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,032 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,032 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,033 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,033 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,033 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,033 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,033 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,033 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,034 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,034 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,034 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,034 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,034 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,034 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,035 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,035 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,035 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,035 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,035 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,035 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,035 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,036 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,036 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,036 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,036 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,036 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,036 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,037 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,037 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,037 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,037 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,037 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,037 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,037 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,038 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,038 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,038 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,038 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,038 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,038 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,039 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,039 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,039 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,039 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,039 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,039 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,039 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,040 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,040 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,040 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,040 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,040 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,040 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,041 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,041 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,041 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,041 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,041 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,041 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,041 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,042 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,042 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,042 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,042 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,042 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,042 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,043 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,043 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,043 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,043 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,043 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,043 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,043 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,044 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-09-26 08:19:45,128 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:19:45,132 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:19:45,133 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:45 BoogieIcfgContainer [2018-09-26 08:19:45,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:45,134 INFO L168 Benchmark]: Toolchain (without parser) took 250867.33 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 36.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:19:45,135 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-09-26 08:19:45,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.69 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-09-26 08:19:45,136 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 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-09-26 08:19:45,136 INFO L168 Benchmark]: RCFGBuilder took 270.31 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-09-26 08:19:45,136 INFO L168 Benchmark]: TraceAbstraction took 250524.31 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 25.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:19:45,139 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.19 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 41.69 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 22.45 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 270.31 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 250524.31 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 25.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 75). Cancelled while BasicCegarLoop was analyzing trace of length 505 with TraceHistMax 126, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 503 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 250.4s OverallTime, 189 OverallIterations, 126 TraceHistogramMax, 110.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12353 SDtfs, 9592 SDslu, 183346 SDs, 0 SdLazy, 195463 SolverSat, 22757 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35169 GetRequests, 4034 SyntacticMatches, 0 SemanticMatches, 31135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271377 ImplicationChecksByTransitivity, 109.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=188, 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: 4.5s AutomataMinimizationTime, 188 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 39.0s SatisfiabilityAnalysisTime, 79.7s InterpolantComputationTime, 47264 NumberOfCodeBlocks, 47264 NumberOfCodeBlocksAsserted, 188 NumberOfCheckSat, 47076 ConstructedInterpolants, 0 QuantifiedInterpolants, 57307865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 188 InterpolantComputations, 2 PerfectInterpolantSequences, 972600/1929700 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/fragtest_simple.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-45-147.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/fragtest_simple.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-45-147.csv Completed graceful shutdown