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/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:10:31,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:10:31,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:10:31,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:10:31,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:10:31,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:10:31,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:10:31,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:10:31,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:10:31,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:10:31,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:10:31,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:10:31,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:10:31,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:10:31,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:10:31,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:10:31,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:10:31,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:10:31,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:10:31,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:10:31,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:10:31,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:10:31,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:10:31,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:10:31,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:10:31,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:10:31,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:10:31,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:10:31,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:10:31,079 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:10:31,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:10:31,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:10:31,081 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:10:31,081 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:10:31,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:10:31,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:10:31,083 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:10:31,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:10:31,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:10:31,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:10:31,094 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:10:31,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:10:31,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:10:31,094 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:10:31,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:10:31,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:10:31,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:10:31,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:10:31,159 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:10:31,160 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:10:31,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-09-26 08:10:31,161 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-09-26 08:10:31,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:10:31,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:10:31,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:31,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:10:31,229 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:10:31,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:31,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:10:31,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:10:31,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:10:31,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:10:31,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:10:31,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:10:31,297 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:10:31,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/1) ... [2018-09-26 08:10:31,380 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:10:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:10:31,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:10:31,550 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:10:31,550 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:31 BoogieIcfgContainer [2018-09-26 08:10:31,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:10:31,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:10:31,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:10:31,556 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:10:31,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:31" (1/2) ... [2018-09-26 08:10:31,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a577189 and model type down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:10:31, skipping insertion in model container [2018-09-26 08:10:31,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:31" (2/2) ... [2018-09-26 08:10:31,561 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-09-26 08:10:31,571 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:10:31,579 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:10:31,628 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:10:31,629 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:10:31,629 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:10:31,629 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:10:31,629 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:10:31,630 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:10:31,630 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:10:31,630 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:10:31,630 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:10:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-26 08:10:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:10:31,656 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:31,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:10:31,659 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:31,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash 28868155, now seen corresponding path program 1 times [2018-09-26 08:10:31,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:31,757 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:10:31,760 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:31,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:10:31,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:31,786 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2018-09-26 08:10:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:31,834 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-09-26 08:10:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:10:31,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-26 08:10:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:31,849 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:10:31,850 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:10:31,853 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:10:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:10:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:10:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:10:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-26 08:10:31,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-09-26 08:10:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:31,896 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-26 08:10:31,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-26 08:10:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:10:31,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:31,897 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:10:31,898 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:31,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:31,898 INFO L82 PathProgramCache]: Analyzing trace with hash 892360290, now seen corresponding path program 1 times [2018-09-26 08:10:31,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:31,948 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:31,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:10:31,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:31,952 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-26 08:10:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,000 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-09-26 08:10:32,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:32,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-09-26 08:10:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,002 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:10:32,002 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:10:32,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:10:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-09-26 08:10:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:10:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:10:32,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-26 08:10:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,008 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:10:32,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:10:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:10:32,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,010 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,010 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1435154486, now seen corresponding path program 1 times [2018-09-26 08:10:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:32,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:32,088 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-09-26 08:10:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,166 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-09-26 08:10:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:32,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 08:10:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,168 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:10:32,168 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:10:32,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:10:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:10:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:10:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-09-26 08:10:32,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-09-26 08:10:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,176 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-09-26 08:10:32,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-09-26 08:10:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:10:32,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,177 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:10:32,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash 299903555, now seen corresponding path program 2 times [2018-09-26 08:10:32,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:32,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:32,219 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2018-09-26 08:10:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,282 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-09-26 08:10:32,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:32,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-09-26 08:10:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,287 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:10:32,287 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:10:32,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:10:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-09-26 08:10:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:10:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-09-26 08:10:32,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2018-09-26 08:10:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,295 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-09-26 08:10:32,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-09-26 08:10:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:10:32,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,297 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-09-26 08:10:32,300 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 444573547, now seen corresponding path program 3 times [2018-09-26 08:10:32,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:32,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:32,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:32,367 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2018-09-26 08:10:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,450 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-09-26 08:10:32,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:32,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 08:10:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,452 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:10:32,452 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:10:32,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:10:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:10:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:10:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:10:32,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-09-26 08:10:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,467 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:10:32,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:10:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:10:32,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,468 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2018-09-26 08:10:32,469 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash -372734382, now seen corresponding path program 4 times [2018-09-26 08:10:32,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,508 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:10:32,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:32,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:32,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:32,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:32,510 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-09-26 08:10:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,552 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-26 08:10:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:32,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:10:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,553 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:10:32,553 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:10:32,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:10:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-09-26 08:10:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:10:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:10:32,562 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-26 08:10:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,563 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:10:32,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:10:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:10:32,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,564 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2018-09-26 08:10:32,564 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1715389510, now seen corresponding path program 5 times [2018-09-26 08:10:32,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,626 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:10:32,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:32,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:32,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:32,628 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2018-09-26 08:10:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,722 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-09-26 08:10:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:32,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-09-26 08:10:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,723 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:10:32,724 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:10:32,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:10:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:10:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:10:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-09-26 08:10:32,733 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-09-26 08:10:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,734 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-09-26 08:10:32,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-09-26 08:10:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:10:32,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,735 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2018-09-26 08:10:32,735 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1966301325, now seen corresponding path program 6 times [2018-09-26 08:10:32,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,796 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:32,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:32,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:32,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:32,799 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2018-09-26 08:10:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,841 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-09-26 08:10:32,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:32,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-09-26 08:10:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,842 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:10:32,843 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:10:32,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:10:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-09-26 08:10:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:10:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-09-26 08:10:32,849 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-09-26 08:10:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,849 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-09-26 08:10:32,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-09-26 08:10:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:10:32,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,850 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2018-09-26 08:10:32,851 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash 170102939, now seen corresponding path program 7 times [2018-09-26 08:10:32,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:32,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:32,889 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-09-26 08:10:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:32,938 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-09-26 08:10:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:32,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-09-26 08:10:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:32,939 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:10:32,939 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:10:32,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:10:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:10:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:10:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:10:32,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-09-26 08:10:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:32,946 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:10:32,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:10:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:10:32,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:32,947 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2018-09-26 08:10:32,948 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:32,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1500682686, now seen corresponding path program 8 times [2018-09-26 08:10:32,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:33,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:33,009 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2018-09-26 08:10:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,067 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-09-26 08:10:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:10:33,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:10:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,070 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:10:33,070 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:10:33,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:10:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-09-26 08:10:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:10:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-26 08:10:33,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-09-26 08:10:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,081 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-26 08:10:33,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-26 08:10:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:10:33,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,082 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2018-09-26 08:10:33,083 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash 953016234, now seen corresponding path program 9 times [2018-09-26 08:10:33,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:33,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:33,138 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 14 states. [2018-09-26 08:10:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,222 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-26 08:10:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:10:33,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-26 08:10:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,224 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:10:33,224 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:10:33,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:10:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:10:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:10:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-09-26 08:10:33,239 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-09-26 08:10:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,239 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-09-26 08:10:33,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:10:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-09-26 08:10:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:33,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,241 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2018-09-26 08:10:33,241 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 954455203, now seen corresponding path program 10 times [2018-09-26 08:10:33,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:33,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:33,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:33,294 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 10 states. [2018-09-26 08:10:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,340 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-09-26 08:10:33,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:10:33,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-09-26 08:10:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,341 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:10:33,341 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:10:33,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:10:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-09-26 08:10:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:10:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-09-26 08:10:33,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-09-26 08:10:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,349 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-09-26 08:10:33,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-09-26 08:10:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:10:33,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,350 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2018-09-26 08:10:33,350 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1891485237, now seen corresponding path program 11 times [2018-09-26 08:10:33,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:33,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:33,420 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2018-09-26 08:10:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,484 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-09-26 08:10:33,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:10:33,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-09-26 08:10:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,485 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:10:33,485 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:10:33,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:10:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:10:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:10:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 08:10:33,496 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-09-26 08:10:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,497 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 08:10:33,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 08:10:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:10:33,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,503 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2018-09-26 08:10:33,503 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1972832718, now seen corresponding path program 12 times [2018-09-26 08:10:33,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:33,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:33,550 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-09-26 08:10:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,603 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-26 08:10:33,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:10:33,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-09-26 08:10:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,604 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:10:33,605 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:10:33,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:10:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:10:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-09-26 08:10:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:10:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:10:33,615 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-26 08:10:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,615 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:10:33,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:10:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:10:33,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,619 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2018-09-26 08:10:33,619 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1811598438, now seen corresponding path program 13 times [2018-09-26 08:10:33,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:10:33,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:10:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:10:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:33,684 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2018-09-26 08:10:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,754 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-09-26 08:10:33,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:10:33,755 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-09-26 08:10:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,756 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:10:33,756 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:10:33,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:10:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:10:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:10:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-09-26 08:10:33,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-09-26 08:10:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,763 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-09-26 08:10:33,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:10:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-09-26 08:10:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:10:33,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,765 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2018-09-26 08:10:33,765 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1422117331, now seen corresponding path program 14 times [2018-09-26 08:10:33,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:33,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:33,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:33,822 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2018-09-26 08:10:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:33,888 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-09-26 08:10:33,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:10:33,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-09-26 08:10:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:33,890 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:10:33,890 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:10:33,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:10:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:10:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-09-26 08:10:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:10:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-09-26 08:10:33,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2018-09-26 08:10:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:33,901 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-09-26 08:10:33,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-09-26 08:10:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:33,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:33,904 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2018-09-26 08:10:33,904 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:33,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 855220987, now seen corresponding path program 15 times [2018-09-26 08:10:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:33,980 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:33,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:10:33,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:10:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:10:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:33,982 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 20 states. [2018-09-26 08:10:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,069 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-09-26 08:10:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:10:34,069 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-09-26 08:10:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,070 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:10:34,070 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:10:34,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:10:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:10:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:10:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 08:10:34,083 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-09-26 08:10:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,083 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 08:10:34,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:10:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 08:10:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:10:34,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,091 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2018-09-26 08:10:34,092 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 365245986, now seen corresponding path program 16 times [2018-09-26 08:10:34,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:10:34,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:10:34,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:10:34,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:34,148 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2018-09-26 08:10:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,200 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-09-26 08:10:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:10:34,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-09-26 08:10:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,201 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:10:34,201 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:10:34,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:10:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-09-26 08:10:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:10:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-09-26 08:10:34,211 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-09-26 08:10:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,214 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-09-26 08:10:34,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-09-26 08:10:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:10:34,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,216 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2018-09-26 08:10:34,216 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1185859702, now seen corresponding path program 17 times [2018-09-26 08:10:34,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:10:34,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:10:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:10:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:34,294 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2018-09-26 08:10:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,398 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-09-26 08:10:34,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:10:34,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-09-26 08:10:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,400 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:10:34,400 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:10:34,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:10:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:10:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:10:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-09-26 08:10:34,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-09-26 08:10:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,413 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-09-26 08:10:34,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:10:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-09-26 08:10:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:10:34,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,416 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2018-09-26 08:10:34,419 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash 562724611, now seen corresponding path program 18 times [2018-09-26 08:10:34,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:34,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:34,481 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 14 states. [2018-09-26 08:10:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,546 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-09-26 08:10:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:34,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-09-26 08:10:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,547 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:10:34,547 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:10:34,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:10:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:10:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-09-26 08:10:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:10:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-09-26 08:10:34,557 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2018-09-26 08:10:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,557 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-09-26 08:10:34,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:10:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-09-26 08:10:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:10:34,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,558 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2018-09-26 08:10:34,558 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash -387462101, now seen corresponding path program 19 times [2018-09-26 08:10:34,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:10:34,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:10:34,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:10:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:10:34,652 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 24 states. [2018-09-26 08:10:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,761 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-09-26 08:10:34,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:34,761 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-09-26 08:10:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,762 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:10:34,762 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:10:34,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:10:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:10:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:10:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-09-26 08:10:34,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-09-26 08:10:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,771 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-09-26 08:10:34,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:10:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-09-26 08:10:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:10:34,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,772 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2018-09-26 08:10:34,773 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1970526702, now seen corresponding path program 20 times [2018-09-26 08:10:34,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:34,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:10:34,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:10:34,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:10:34,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:34,831 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 15 states. [2018-09-26 08:10:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,900 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-26 08:10:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:34,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-09-26 08:10:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,901 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:10:34,901 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:10:34,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:10:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:10:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-09-26 08:10:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:10:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 08:10:34,917 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-09-26 08:10:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,918 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 08:10:34,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:10:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 08:10:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:10:34,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,921 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2018-09-26 08:10:34,921 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash 404482938, now seen corresponding path program 21 times [2018-09-26 08:10:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:10:35,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:10:35,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:10:35,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:35,018 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2018-09-26 08:10:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,149 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-26 08:10:35,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:35,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-09-26 08:10:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,150 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:10:35,150 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:10:35,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:10:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:10:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:10:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-09-26 08:10:35,166 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-09-26 08:10:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,166 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-09-26 08:10:35,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:10:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-09-26 08:10:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:10:35,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,167 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2018-09-26 08:10:35,169 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1932135373, now seen corresponding path program 22 times [2018-09-26 08:10:35,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:35,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:35,252 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 16 states. [2018-09-26 08:10:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,329 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-09-26 08:10:35,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:10:35,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-09-26 08:10:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,330 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:10:35,330 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:10:35,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:10:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-09-26 08:10:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:10:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-09-26 08:10:35,338 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-09-26 08:10:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,339 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-09-26 08:10:35,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-09-26 08:10:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:10:35,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,340 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2018-09-26 08:10:35,340 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1356155557, now seen corresponding path program 23 times [2018-09-26 08:10:35,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:10:35,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:10:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:10:35,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:35,445 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2018-09-26 08:10:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,600 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-09-26 08:10:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:10:35,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2018-09-26 08:10:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,601 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:10:35,601 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:10:35,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:10:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:10:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:10:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:10:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:10:35,615 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-09-26 08:10:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,615 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:10:35,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:10:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:10:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:10:35,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,618 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2018-09-26 08:10:35,618 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1277675010, now seen corresponding path program 24 times [2018-09-26 08:10:35,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:35,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:35,696 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 17 states. [2018-09-26 08:10:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,832 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-09-26 08:10:35,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:10:35,832 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-09-26 08:10:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,833 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:10:35,833 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:10:35,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:10:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-09-26 08:10:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:10:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-26 08:10:35,840 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-26 08:10:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,840 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-26 08:10:35,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-26 08:10:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:10:35,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,841 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2018-09-26 08:10:35,841 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash -514896022, now seen corresponding path program 25 times [2018-09-26 08:10:35,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:10:35,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:10:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:10:35,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:35,939 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2018-09-26 08:10:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,079 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-09-26 08:10:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:10:36,079 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-09-26 08:10:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,080 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:10:36,080 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:10:36,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:10:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:10:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:10:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:10:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-26 08:10:36,087 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-09-26 08:10:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,088 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-26 08:10:36,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:10:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-26 08:10:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:10:36,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,089 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2018-09-26 08:10:36,089 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash -826005149, now seen corresponding path program 26 times [2018-09-26 08:10:36,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:10:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:10:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:10:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:36,157 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2018-09-26 08:10:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,231 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-09-26 08:10:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:10:36,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-09-26 08:10:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,232 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:10:36,232 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:10:36,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:10:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-09-26 08:10:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:10:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-09-26 08:10:36,239 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-09-26 08:10:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,239 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-09-26 08:10:36,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:10:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-09-26 08:10:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:10:36,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,240 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2018-09-26 08:10:36,241 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash 778067595, now seen corresponding path program 27 times [2018-09-26 08:10:36,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:10:36,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:10:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:10:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:36,344 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 32 states. [2018-09-26 08:10:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,502 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-09-26 08:10:36,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:10:36,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2018-09-26 08:10:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,503 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:10:36,503 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:10:36,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:10:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:10:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:10:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:10:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-09-26 08:10:36,513 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-09-26 08:10:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,513 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-09-26 08:10:36,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:10:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-09-26 08:10:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:10:36,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,514 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2018-09-26 08:10:36,514 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1065489906, now seen corresponding path program 28 times [2018-09-26 08:10:36,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:10:36,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:10:36,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:10:36,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:10:36,599 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2018-09-26 08:10:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,686 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-09-26 08:10:36,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:10:36,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-09-26 08:10:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,687 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:10:36,687 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:10:36,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:10:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-09-26 08:10:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:10:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:10:36,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-09-26 08:10:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,696 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:10:36,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:10:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:10:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:10:36,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,697 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2018-09-26 08:10:36,697 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1733649242, now seen corresponding path program 29 times [2018-09-26 08:10:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:10:36,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:10:36,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:10:36,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:36,807 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 34 states. [2018-09-26 08:10:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,972 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-09-26 08:10:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:10:36,972 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 50 [2018-09-26 08:10:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,973 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:10:36,973 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:10:36,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:10:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:10:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:10:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:10:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-09-26 08:10:36,981 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-09-26 08:10:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,982 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-09-26 08:10:36,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:10:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-09-26 08:10:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:10:36,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,983 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2018-09-26 08:10:36,983 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,983 INFO L82 PathProgramCache]: Analyzing trace with hash 166928019, now seen corresponding path program 30 times [2018-09-26 08:10:36,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:10:37,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:10:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:10:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:37,053 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 20 states. [2018-09-26 08:10:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,131 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-09-26 08:10:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:10:37,131 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-09-26 08:10:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,132 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:10:37,132 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:10:37,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:10:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:10:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-09-26 08:10:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:10:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-09-26 08:10:37,140 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2018-09-26 08:10:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,141 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-09-26 08:10:37,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:10:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-09-26 08:10:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:10:37,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,141 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2018-09-26 08:10:37,142 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1504102331, now seen corresponding path program 31 times [2018-09-26 08:10:37,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:10:37,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:10:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:10:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:10:37,262 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 36 states. [2018-09-26 08:10:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,438 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-09-26 08:10:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:10:37,438 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2018-09-26 08:10:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,439 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:10:37,439 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:10:37,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:10:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:10:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:10:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:10:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 08:10:37,449 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2018-09-26 08:10:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,449 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 08:10:37,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:10:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 08:10:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:10:37,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,450 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2018-09-26 08:10:37,450 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash 721753570, now seen corresponding path program 32 times [2018-09-26 08:10:37,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:10:37,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:10:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:10:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:10:37,528 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 21 states. [2018-09-26 08:10:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,612 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-09-26 08:10:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:10:37,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-09-26 08:10:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,613 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:10:37,614 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:10:37,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:10:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:10:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-09-26 08:10:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:10:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-26 08:10:37,622 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-09-26 08:10:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,622 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-26 08:10:37,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:10:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-26 08:10:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:10:37,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,623 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2018-09-26 08:10:37,623 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2115512138, now seen corresponding path program 33 times [2018-09-26 08:10:37,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:10:37,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:10:37,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:10:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:37,744 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 38 states. [2018-09-26 08:10:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,940 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-09-26 08:10:37,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:10:37,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2018-09-26 08:10:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,941 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:10:37,941 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:10:37,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:10:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:10:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:10:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:10:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-09-26 08:10:37,951 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-09-26 08:10:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,951 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-09-26 08:10:37,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:10:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-09-26 08:10:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:10:37,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,952 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2018-09-26 08:10:37,952 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,953 INFO L82 PathProgramCache]: Analyzing trace with hash -343878717, now seen corresponding path program 34 times [2018-09-26 08:10:37,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:10:38,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:10:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:10:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:38,038 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 22 states. [2018-09-26 08:10:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,130 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-09-26 08:10:38,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:10:38,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-09-26 08:10:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,132 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:10:38,132 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:10:38,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:10:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:10:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-09-26 08:10:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:10:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-09-26 08:10:38,142 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-09-26 08:10:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,142 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-09-26 08:10:38,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:10:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-09-26 08:10:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:10:38,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,144 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2018-09-26 08:10:38,144 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,144 INFO L82 PathProgramCache]: Analyzing trace with hash 245100779, now seen corresponding path program 35 times [2018-09-26 08:10:38,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:10:38,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:10:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:10:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:10:38,305 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 40 states. [2018-09-26 08:10:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,545 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-09-26 08:10:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:10:38,545 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2018-09-26 08:10:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,546 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:10:38,546 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:10:38,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:10:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:10:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:10:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:10:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-26 08:10:38,559 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-09-26 08:10:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,559 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-26 08:10:38,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:10:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-26 08:10:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:10:38,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,560 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2018-09-26 08:10:38,562 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash 379241938, now seen corresponding path program 36 times [2018-09-26 08:10:38,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:10:38,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:10:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:10:38,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:38,720 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 23 states. [2018-09-26 08:10:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,869 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-09-26 08:10:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:10:38,870 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-09-26 08:10:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,870 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:10:38,870 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:10:38,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:10:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:10:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-09-26 08:10:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:10:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 08:10:38,884 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-26 08:10:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,884 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 08:10:38,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:10:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 08:10:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:10:38,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,885 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2018-09-26 08:10:38,885 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash -620651718, now seen corresponding path program 37 times [2018-09-26 08:10:38,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:10:39,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:10:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:10:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:10:39,081 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 42 states. [2018-09-26 08:10:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,223 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-09-26 08:10:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:10:39,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2018-09-26 08:10:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,224 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:10:39,224 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:10:39,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:10:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:10:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:10:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:10:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-09-26 08:10:39,235 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-09-26 08:10:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,235 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-09-26 08:10:39,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:10:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-09-26 08:10:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:10:39,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,236 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2018-09-26 08:10:39,236 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1259030771, now seen corresponding path program 38 times [2018-09-26 08:10:39,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:10:39,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:10:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:10:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:10:39,349 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 24 states. [2018-09-26 08:10:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,449 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-09-26 08:10:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:10:39,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-09-26 08:10:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,450 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:10:39,450 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:10:39,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:10:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:10:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-09-26 08:10:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:10:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-09-26 08:10:39,461 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-09-26 08:10:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,461 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-09-26 08:10:39,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:10:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-09-26 08:10:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:10:39,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,462 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2018-09-26 08:10:39,462 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1252140517, now seen corresponding path program 39 times [2018-09-26 08:10:39,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:10:39,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:10:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:10:39,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:10:39,615 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 44 states. [2018-09-26 08:10:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,857 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-09-26 08:10:39,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:10:39,857 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2018-09-26 08:10:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,858 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:10:39,858 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:10:39,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:10:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:10:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:10:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:10:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:10:39,868 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2018-09-26 08:10:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,869 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:10:39,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:10:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:10:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:10:39,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,870 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2018-09-26 08:10:39,870 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1414715966, now seen corresponding path program 40 times [2018-09-26 08:10:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:10:39,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:10:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:10:39,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:10:39,986 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 25 states. [2018-09-26 08:10:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,095 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-09-26 08:10:40,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:10:40,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2018-09-26 08:10:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,096 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:10:40,096 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:10:40,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:10:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:10:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-09-26 08:10:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:10:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-09-26 08:10:40,107 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-09-26 08:10:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,107 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-09-26 08:10:40,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:10:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-09-26 08:10:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:10:40,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,108 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2018-09-26 08:10:40,109 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1962655530, now seen corresponding path program 41 times [2018-09-26 08:10:40,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:10:40,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:10:40,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:10:40,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:10:40,265 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 46 states. [2018-09-26 08:10:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,523 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-09-26 08:10:40,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:10:40,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2018-09-26 08:10:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,524 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:10:40,524 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:10:40,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:10:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:10:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:10:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:10:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-09-26 08:10:40,537 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-09-26 08:10:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,537 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-09-26 08:10:40,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:10:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-09-26 08:10:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:10:40,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,538 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2018-09-26 08:10:40,538 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,539 INFO L82 PathProgramCache]: Analyzing trace with hash -894403037, now seen corresponding path program 42 times [2018-09-26 08:10:40,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:10:40,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:10:40,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:10:40,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:40,637 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2018-09-26 08:10:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,745 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-09-26 08:10:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:10:40,745 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-09-26 08:10:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,746 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:10:40,746 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:10:40,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:10:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:10:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-09-26 08:10:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:10:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-09-26 08:10:40,757 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-09-26 08:10:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,758 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-09-26 08:10:40,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:10:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-09-26 08:10:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:10:40,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,759 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2018-09-26 08:10:40,759 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash -527793333, now seen corresponding path program 43 times [2018-09-26 08:10:40,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:10:40,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:10:40,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:10:40,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:10:40,914 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 48 states. [2018-09-26 08:10:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,210 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-09-26 08:10:41,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:10:41,210 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2018-09-26 08:10:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,211 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:10:41,211 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:10:41,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:10:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:10:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:10:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:10:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-09-26 08:10:41,224 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-09-26 08:10:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,225 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-09-26 08:10:41,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:10:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-09-26 08:10:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:10:41,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,226 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2018-09-26 08:10:41,226 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1792657998, now seen corresponding path program 44 times [2018-09-26 08:10:41,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:41,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:41,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:10:41,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:10:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:10:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:10:41,336 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 27 states. [2018-09-26 08:10:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,475 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-26 08:10:41,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:10:41,475 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-09-26 08:10:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,476 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:10:41,476 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:10:41,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:10:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:10:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-09-26 08:10:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:10:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:10:41,489 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-09-26 08:10:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,490 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:10:41,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:10:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:10:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:10:41,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,491 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2018-09-26 08:10:41,491 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash -462384358, now seen corresponding path program 45 times [2018-09-26 08:10:41,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:41,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:41,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:10:41,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:10:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:10:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:10:41,706 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 50 states. [2018-09-26 08:10:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,005 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-09-26 08:10:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:10:42,005 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2018-09-26 08:10:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,006 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:10:42,006 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:10:42,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:10:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:10:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:10:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:10:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-09-26 08:10:42,021 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-09-26 08:10:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,021 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-09-26 08:10:42,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:10:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-09-26 08:10:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:10:42,022 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,022 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2018-09-26 08:10:42,022 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1997435731, now seen corresponding path program 46 times [2018-09-26 08:10:42,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:10:42,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:10:42,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:10:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:42,177 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2018-09-26 08:10:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,291 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-09-26 08:10:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:10:42,291 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2018-09-26 08:10:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,292 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:10:42,292 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:10:42,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:10:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:10:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-09-26 08:10:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:10:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-09-26 08:10:42,307 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-09-26 08:10:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,307 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-09-26 08:10:42,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:10:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-09-26 08:10:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:10:42,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,309 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2018-09-26 08:10:42,309 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash -314577797, now seen corresponding path program 47 times [2018-09-26 08:10:42,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,481 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:10:42,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:10:42,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:10:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:10:42,483 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 52 states. [2018-09-26 08:10:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,785 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-09-26 08:10:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:10:42,785 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 77 [2018-09-26 08:10:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,786 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:10:42,786 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:10:42,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:10:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:10:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:10:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:10:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 08:10:42,800 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2018-09-26 08:10:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,801 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 08:10:42,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:10:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 08:10:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:10:42,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,802 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2018-09-26 08:10:42,802 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash -546310750, now seen corresponding path program 48 times [2018-09-26 08:10:42,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:10:42,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:10:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:10:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:42,907 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 29 states. [2018-09-26 08:10:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,023 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-09-26 08:10:43,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:10:43,023 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2018-09-26 08:10:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,024 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:10:43,024 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:10:43,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:10:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:10:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-09-26 08:10:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:10:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-26 08:10:43,037 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-26 08:10:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,038 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-26 08:10:43,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:10:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-26 08:10:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:10:43,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,039 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2018-09-26 08:10:43,039 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1018554614, now seen corresponding path program 49 times [2018-09-26 08:10:43,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:10:43,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:10:43,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:10:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:10:43,216 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 54 states. [2018-09-26 08:10:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,433 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-09-26 08:10:43,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:10:43,433 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 80 [2018-09-26 08:10:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,434 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:10:43,434 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:10:43,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:10:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:10:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:10:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:10:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-09-26 08:10:43,449 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-09-26 08:10:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,449 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-09-26 08:10:43,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:10:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-09-26 08:10:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:10:43,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,450 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2018-09-26 08:10:43,451 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1732454531, now seen corresponding path program 50 times [2018-09-26 08:10:43,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:10:43,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:10:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:10:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:43,565 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 30 states. [2018-09-26 08:10:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,690 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-09-26 08:10:43,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:10:43,691 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 81 [2018-09-26 08:10:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,692 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:10:43,692 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:10:43,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:10:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:10:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-09-26 08:10:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:10:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-09-26 08:10:43,707 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2018-09-26 08:10:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,707 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-09-26 08:10:43,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:10:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-09-26 08:10:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:10:43,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,709 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2018-09-26 08:10:43,709 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1558440533, now seen corresponding path program 51 times [2018-09-26 08:10:43,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:10:43,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:10:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:10:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:10:43,889 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 56 states. [2018-09-26 08:10:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,240 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-09-26 08:10:44,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:10:44,241 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2018-09-26 08:10:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,242 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:10:44,242 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:10:44,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:10:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:10:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:10:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:10:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-09-26 08:10:44,258 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-09-26 08:10:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,259 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-09-26 08:10:44,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:10:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-09-26 08:10:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:10:44,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,260 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2018-09-26 08:10:44,260 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1484023186, now seen corresponding path program 52 times [2018-09-26 08:10:44,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:44,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:10:44,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:10:44,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:10:44,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:44,370 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 31 states. [2018-09-26 08:10:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,499 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-09-26 08:10:44,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:10:44,499 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-09-26 08:10:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,500 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:10:44,500 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:10:44,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:10:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:10:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-09-26 08:10:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:10:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 08:10:44,517 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-09-26 08:10:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,517 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 08:10:44,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:10:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 08:10:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:10:44,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,518 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2018-09-26 08:10:44,519 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,519 INFO L82 PathProgramCache]: Analyzing trace with hash 217205498, now seen corresponding path program 53 times [2018-09-26 08:10:44,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:44,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:10:44,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:10:44,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:10:44,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:10:44,705 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 58 states. [2018-09-26 08:10:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,094 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-09-26 08:10:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:10:45,095 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 86 [2018-09-26 08:10:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,096 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:10:45,096 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:10:45,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:10:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:10:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:10:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:10:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-09-26 08:10:45,113 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-09-26 08:10:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,113 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-09-26 08:10:45,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:10:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-09-26 08:10:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:10:45,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,115 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2018-09-26 08:10:45,115 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1559010739, now seen corresponding path program 54 times [2018-09-26 08:10:45,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:10:45,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:10:45,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:10:45,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:45,260 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 32 states. [2018-09-26 08:10:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,425 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-09-26 08:10:45,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:10:45,425 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 87 [2018-09-26 08:10:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,426 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:10:45,427 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:10:45,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:10:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:10:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-09-26 08:10:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:10:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-09-26 08:10:45,480 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2018-09-26 08:10:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,481 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-09-26 08:10:45,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:10:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-09-26 08:10:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:10:45,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,482 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2018-09-26 08:10:45,482 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash -734200101, now seen corresponding path program 55 times [2018-09-26 08:10:45,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:10:45,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:10:45,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:10:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:10:45,683 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 60 states. [2018-09-26 08:10:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,065 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-09-26 08:10:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:10:46,065 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 89 [2018-09-26 08:10:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,066 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:10:46,066 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:10:46,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:10:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:10:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:10:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:10:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:10:46,082 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2018-09-26 08:10:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,083 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:10:46,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:10:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:10:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:10:46,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,084 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2018-09-26 08:10:46,084 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash -274889342, now seen corresponding path program 56 times [2018-09-26 08:10:46,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:10:46,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:10:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:10:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:46,209 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 33 states. [2018-09-26 08:10:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,329 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-09-26 08:10:46,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:10:46,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2018-09-26 08:10:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,330 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:10:46,330 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:10:46,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:10:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:10:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-09-26 08:10:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:10:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-26 08:10:46,345 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-26 08:10:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,345 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-26 08:10:46,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:10:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-26 08:10:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:10:46,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,346 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2018-09-26 08:10:46,346 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2119380714, now seen corresponding path program 57 times [2018-09-26 08:10:46,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:10:46,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:10:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:10:46,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:10:46,541 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 62 states. [2018-09-26 08:10:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,932 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-09-26 08:10:46,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:10:46,932 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 92 [2018-09-26 08:10:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,933 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:10:46,933 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:10:46,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:10:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:10:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:10:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:10:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-09-26 08:10:46,948 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-09-26 08:10:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,948 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-09-26 08:10:46,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:10:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-09-26 08:10:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:10:46,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,950 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2018-09-26 08:10:46,950 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1680397027, now seen corresponding path program 58 times [2018-09-26 08:10:46,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:47,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:10:47,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:10:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:10:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:47,076 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 34 states. [2018-09-26 08:10:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,211 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-09-26 08:10:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:10:47,212 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2018-09-26 08:10:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,213 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:10:47,213 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:10:47,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:10:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:10:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-09-26 08:10:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:10:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-09-26 08:10:47,228 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-09-26 08:10:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,228 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-09-26 08:10:47,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:10:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-09-26 08:10:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:10:47,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,230 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2018-09-26 08:10:47,230 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -46094325, now seen corresponding path program 59 times [2018-09-26 08:10:47,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:47,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:10:47,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:10:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:10:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:10:47,456 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 64 states. [2018-09-26 08:10:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,880 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-09-26 08:10:47,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:10:47,880 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 95 [2018-09-26 08:10:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,881 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:10:47,881 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:10:47,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:10:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:10:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:10:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:10:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-26 08:10:47,897 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-09-26 08:10:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,897 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-26 08:10:47,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:10:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-26 08:10:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:10:47,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,899 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2018-09-26 08:10:47,899 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash 366302578, now seen corresponding path program 60 times [2018-09-26 08:10:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:48,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:10:48,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:10:48,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:10:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:48,028 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 35 states. [2018-09-26 08:10:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,171 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-09-26 08:10:48,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:10:48,171 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 96 [2018-09-26 08:10:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,172 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:10:48,172 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:10:48,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:10:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:10:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-09-26 08:10:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:10:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:10:48,189 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-26 08:10:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:10:48,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:10:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:10:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:10:48,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,190 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2018-09-26 08:10:48,190 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash -170474790, now seen corresponding path program 61 times [2018-09-26 08:10:48,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:48,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:10:48,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:10:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:10:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:10:48,411 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 66 states. [2018-09-26 08:10:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,881 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-09-26 08:10:48,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:10:48,881 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 98 [2018-09-26 08:10:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,882 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:10:48,882 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:10:48,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:10:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:10:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:10:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:10:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-09-26 08:10:48,898 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-09-26 08:10:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,898 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-09-26 08:10:48,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:10:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-09-26 08:10:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:10:48,899 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,899 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2018-09-26 08:10:48,899 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1939195923, now seen corresponding path program 62 times [2018-09-26 08:10:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:49,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:10:49,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:10:49,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:10:49,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:10:49,030 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 36 states. [2018-09-26 08:10:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,172 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2018-09-26 08:10:49,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:10:49,172 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-09-26 08:10:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,173 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:10:49,173 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:10:49,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:10:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:10:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-09-26 08:10:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:10:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-09-26 08:10:49,190 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-09-26 08:10:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,190 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-09-26 08:10:49,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:10:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-09-26 08:10:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:10:49,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,192 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2018-09-26 08:10:49,192 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash -448458437, now seen corresponding path program 63 times [2018-09-26 08:10:49,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:49,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:10:49,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:10:49,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:10:49,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:10:49,400 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 68 states. [2018-09-26 08:10:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,841 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-09-26 08:10:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:10:49,842 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 101 [2018-09-26 08:10:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,843 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:10:49,843 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:10:49,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:10:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:10:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:10:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:10:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 08:10:49,858 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2018-09-26 08:10:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,858 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 08:10:49,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:10:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 08:10:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:10:49,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,859 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2018-09-26 08:10:49,859 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash 495310178, now seen corresponding path program 64 times [2018-09-26 08:10:49,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:49,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:10:49,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:10:49,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:10:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:10:49,995 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 37 states. [2018-09-26 08:10:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,142 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-09-26 08:10:50,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:10:50,142 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 102 [2018-09-26 08:10:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,143 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:10:50,143 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:10:50,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:10:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:10:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-09-26 08:10:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:10:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-09-26 08:10:50,158 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-09-26 08:10:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,158 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-09-26 08:10:50,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:10:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-09-26 08:10:50,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:10:50,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,160 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2018-09-26 08:10:50,160 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,160 INFO L82 PathProgramCache]: Analyzing trace with hash -748222774, now seen corresponding path program 65 times [2018-09-26 08:10:50,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:50,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:50,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:10:50,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:10:50,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:10:50,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:10:50,368 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 70 states. [2018-09-26 08:10:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,844 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-09-26 08:10:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:10:50,845 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 104 [2018-09-26 08:10:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,846 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:10:50,846 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:10:50,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:10:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:10:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:10:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:10:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-09-26 08:10:50,861 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-09-26 08:10:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,861 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-09-26 08:10:50,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:10:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-09-26 08:10:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:10:50,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,862 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2018-09-26 08:10:50,863 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 206667075, now seen corresponding path program 66 times [2018-09-26 08:10:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:50,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:50,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:10:50,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:10:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:10:50,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:50,997 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 38 states. [2018-09-26 08:10:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,148 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-09-26 08:10:51,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:10:51,148 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2018-09-26 08:10:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,149 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:10:51,149 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:10:51,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:10:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:10:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-09-26 08:10:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:10:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-09-26 08:10:51,164 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2018-09-26 08:10:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,164 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-09-26 08:10:51,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:10:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-09-26 08:10:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:10:51,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,166 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2018-09-26 08:10:51,166 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1038629483, now seen corresponding path program 67 times [2018-09-26 08:10:51,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:51,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:51,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:10:51,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:10:51,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:10:51,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:10:51,405 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 72 states. [2018-09-26 08:10:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,965 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-09-26 08:10:51,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:10:51,965 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 107 [2018-09-26 08:10:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,967 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:10:51,967 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:10:51,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:10:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:10:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:10:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:10:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-26 08:10:51,988 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-09-26 08:10:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,989 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-26 08:10:51,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:10:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-26 08:10:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:10:51,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,990 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2018-09-26 08:10:51,991 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1701247662, now seen corresponding path program 68 times [2018-09-26 08:10:51,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:52,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:10:52,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:10:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:10:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:10:52,219 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 39 states. [2018-09-26 08:10:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:52,365 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-26 08:10:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:10:52,365 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 108 [2018-09-26 08:10:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:52,366 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:10:52,366 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:10:52,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:10:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:10:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-09-26 08:10:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:10:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 08:10:52,381 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-26 08:10:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:52,381 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 08:10:52,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:10:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 08:10:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:10:52,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:52,383 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2018-09-26 08:10:52,383 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:52,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1483602618, now seen corresponding path program 69 times [2018-09-26 08:10:52,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:52,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:10:52,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:10:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:10:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:10:52,624 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 74 states. [2018-09-26 08:10:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,140 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-09-26 08:10:53,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:10:53,140 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 110 [2018-09-26 08:10:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,141 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:10:53,141 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:10:53,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:10:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:10:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:10:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:10:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-09-26 08:10:53,158 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-09-26 08:10:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,159 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-09-26 08:10:53,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:10:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-09-26 08:10:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:10:53,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,160 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2018-09-26 08:10:53,160 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,161 INFO L82 PathProgramCache]: Analyzing trace with hash -637930893, now seen corresponding path program 70 times [2018-09-26 08:10:53,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:53,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:53,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:10:53,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:10:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:10:53,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:10:53,317 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 40 states. [2018-09-26 08:10:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,467 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-09-26 08:10:53,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:10:53,468 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 111 [2018-09-26 08:10:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,469 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:10:53,469 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:10:53,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:10:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:10:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-09-26 08:10:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:10:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-09-26 08:10:53,491 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2018-09-26 08:10:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,491 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-09-26 08:10:53,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:10:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-09-26 08:10:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:10:53,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,493 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2018-09-26 08:10:53,493 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1128801179, now seen corresponding path program 71 times [2018-09-26 08:10:53,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:53,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:53,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:10:53,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:10:53,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:10:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:10:53,740 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 76 states. [2018-09-26 08:10:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,064 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-09-26 08:10:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:10:54,064 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 113 [2018-09-26 08:10:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,065 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:10:54,065 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:10:54,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:10:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:10:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:10:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:10:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:10:54,085 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2018-09-26 08:10:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,085 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:10:54,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:10:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:10:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:10:54,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,087 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2018-09-26 08:10:54,087 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1032264382, now seen corresponding path program 72 times [2018-09-26 08:10:54,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:10:54,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:10:54,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:10:54,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:10:54,253 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 41 states. [2018-09-26 08:10:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,425 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-09-26 08:10:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:10:54,425 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 114 [2018-09-26 08:10:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,426 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:10:54,426 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:10:54,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:10:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:10:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-09-26 08:10:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:10:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-09-26 08:10:54,445 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-09-26 08:10:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,446 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-09-26 08:10:54,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:10:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-09-26 08:10:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:10:54,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,447 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2018-09-26 08:10:54,448 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash 131440298, now seen corresponding path program 73 times [2018-09-26 08:10:54,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:10:54,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:10:54,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:10:54,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:10:54,724 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 78 states. [2018-09-26 08:10:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,292 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-09-26 08:10:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:10:55,293 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 116 [2018-09-26 08:10:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,294 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:10:55,294 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:10:55,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:10:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:10:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:10:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:10:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-09-26 08:10:55,311 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-09-26 08:10:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,311 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-09-26 08:10:55,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:10:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-09-26 08:10:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:10:55,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,312 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2018-09-26 08:10:55,313 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1387079587, now seen corresponding path program 74 times [2018-09-26 08:10:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:55,512 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:10:55,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:10:55,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:10:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:10:55,513 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 42 states. [2018-09-26 08:10:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,664 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-09-26 08:10:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:10:55,664 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 117 [2018-09-26 08:10:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,665 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:10:55,665 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:10:55,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:10:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:10:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-09-26 08:10:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:10:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-09-26 08:10:55,682 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-09-26 08:10:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,682 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-09-26 08:10:55,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:10:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-09-26 08:10:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:10:55,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,683 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2018-09-26 08:10:55,684 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1543687371, now seen corresponding path program 75 times [2018-09-26 08:10:55,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:55,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:10:55,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:10:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:10:55,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:10:55,933 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 80 states. [2018-09-26 08:10:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,551 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-09-26 08:10:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:10:56,551 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 119 [2018-09-26 08:10:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,552 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:10:56,552 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:10:56,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:10:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:10:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:10:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:10:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-09-26 08:10:56,569 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2018-09-26 08:10:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,569 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-09-26 08:10:56,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:10:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-09-26 08:10:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:10:56,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,571 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2018-09-26 08:10:56,571 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,572 INFO L82 PathProgramCache]: Analyzing trace with hash -871402190, now seen corresponding path program 76 times [2018-09-26 08:10:56,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:56,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:10:56,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:10:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:10:56,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:10:56,735 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 43 states. [2018-09-26 08:10:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,898 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-09-26 08:10:56,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:10:56,899 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2018-09-26 08:10:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,900 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:10:56,900 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:10:56,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:10:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:10:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-09-26 08:10:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:10:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:10:56,916 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-09-26 08:10:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,916 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:10:56,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:10:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:10:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:10:56,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,918 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2018-09-26 08:10:56,918 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash 101184154, now seen corresponding path program 77 times [2018-09-26 08:10:56,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:57,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:10:57,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:10:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:10:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:10:57,165 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 82 states. [2018-09-26 08:10:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,759 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-09-26 08:10:57,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:10:57,759 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 122 [2018-09-26 08:10:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,760 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:10:57,760 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:10:57,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:10:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:10:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:10:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:10:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-09-26 08:10:57,779 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-09-26 08:10:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,779 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-09-26 08:10:57,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:10:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-09-26 08:10:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:10:57,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,781 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2018-09-26 08:10:57,781 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1460214995, now seen corresponding path program 78 times [2018-09-26 08:10:57,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:57,948 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:10:57,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:10:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:10:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:10:57,950 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 44 states. [2018-09-26 08:10:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,133 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-09-26 08:10:58,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:10:58,133 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2018-09-26 08:10:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,134 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:10:58,134 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:10:58,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:10:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:10:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-09-26 08:10:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:10:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-09-26 08:10:58,152 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-09-26 08:10:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,152 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-09-26 08:10:58,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:10:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-09-26 08:10:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:10:58,153 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,154 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2018-09-26 08:10:58,154 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1187629573, now seen corresponding path program 79 times [2018-09-26 08:10:58,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:58,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:10:58,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:10:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:10:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:10:58,390 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 84 states. [2018-09-26 08:10:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,072 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-09-26 08:10:59,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:10:59,072 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 125 [2018-09-26 08:10:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,076 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:10:59,076 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:10:59,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:10:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:10:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:10:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:10:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 08:10:59,103 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2018-09-26 08:10:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,104 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 08:10:59,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:10:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 08:10:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:10:59,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,106 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2018-09-26 08:10:59,106 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1338422562, now seen corresponding path program 80 times [2018-09-26 08:10:59,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:59,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:10:59,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:10:59,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:10:59,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:10:59,321 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 45 states. [2018-09-26 08:10:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,531 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-09-26 08:10:59,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:10:59,531 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2018-09-26 08:10:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,532 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:10:59,532 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:10:59,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:10:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:10:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-09-26 08:10:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:10:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-26 08:10:59,549 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-26 08:10:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,549 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-26 08:10:59,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:10:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-26 08:10:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:10:59,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,550 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2018-09-26 08:10:59,550 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2028926602, now seen corresponding path program 81 times [2018-09-26 08:10:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:59,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:10:59,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:10:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:10:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:10:59,822 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 86 states. [2018-09-26 08:11:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,539 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-09-26 08:11:00,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:11:00,540 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 128 [2018-09-26 08:11:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,541 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:11:00,541 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:11:00,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:11:00,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:11:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:11:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:11:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-09-26 08:11:00,558 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-09-26 08:11:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,558 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-09-26 08:11:00,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:11:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-09-26 08:11:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:11:00,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,559 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2018-09-26 08:11:00,560 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -768880125, now seen corresponding path program 82 times [2018-09-26 08:11:00,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:00,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:11:00,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:11:00,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:11:00,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:00,735 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 46 states. [2018-09-26 08:11:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,915 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-09-26 08:11:00,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:11:00,915 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-09-26 08:11:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,916 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:11:00,916 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:11:00,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:11:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:11:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-09-26 08:11:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:11:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-09-26 08:11:00,935 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2018-09-26 08:11:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,936 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-09-26 08:11:00,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:11:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-09-26 08:11:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:11:00,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,937 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2018-09-26 08:11:00,937 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash -159359189, now seen corresponding path program 83 times [2018-09-26 08:11:00,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:01,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:01,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:11:01,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:11:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:11:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:11:01,224 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 88 states. [2018-09-26 08:11:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,540 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-09-26 08:11:01,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:11:01,540 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 131 [2018-09-26 08:11:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,541 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:11:01,541 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:11:01,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:11:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:11:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:11:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:11:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-26 08:11:01,563 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2018-09-26 08:11:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,563 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-26 08:11:01,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:11:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-26 08:11:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:11:01,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,564 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2018-09-26 08:11:01,564 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1484217070, now seen corresponding path program 84 times [2018-09-26 08:11:01,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:01,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:01,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:11:01,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:11:01,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:11:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:01,759 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 47 states. [2018-09-26 08:11:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,949 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-09-26 08:11:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:11:01,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 132 [2018-09-26 08:11:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,950 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:11:01,951 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:11:01,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:11:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:11:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-09-26 08:11:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:11:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 08:11:01,969 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-26 08:11:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,969 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 08:11:01,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:11:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 08:11:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:11:01,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,970 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2018-09-26 08:11:01,971 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash -403395974, now seen corresponding path program 85 times [2018-09-26 08:11:01,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:02,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:11:02,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:11:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:11:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:11:02,284 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 90 states. [2018-09-26 08:11:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,013 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-09-26 08:11:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:11:03,013 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 134 [2018-09-26 08:11:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,014 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:11:03,014 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:11:03,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:11:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:11:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:11:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:11:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-09-26 08:11:03,036 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-09-26 08:11:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,036 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-09-26 08:11:03,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:11:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-09-26 08:11:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:11:03,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,037 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2018-09-26 08:11:03,037 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1504921395, now seen corresponding path program 86 times [2018-09-26 08:11:03,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:03,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:03,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:11:03,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:11:03,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:11:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:03,288 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 48 states. [2018-09-26 08:11:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,461 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-09-26 08:11:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:11:03,461 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 135 [2018-09-26 08:11:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,462 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:11:03,462 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:11:03,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:11:03,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:11:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-09-26 08:11:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:11:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-09-26 08:11:03,486 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2018-09-26 08:11:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,487 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-09-26 08:11:03,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:11:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-09-26 08:11:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:11:03,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,488 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2018-09-26 08:11:03,488 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1174452133, now seen corresponding path program 87 times [2018-09-26 08:11:03,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:03,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:03,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:11:03,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:11:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:11:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:11:03,791 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 92 states. [2018-09-26 08:11:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,463 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-09-26 08:11:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:11:04,463 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 137 [2018-09-26 08:11:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,464 INFO L225 Difference]: With dead ends: 232 [2018-09-26 08:11:04,464 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:11:04,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:11:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:11:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:11:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:11:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:11:04,495 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2018-09-26 08:11:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,495 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:11:04,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:11:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:11:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:11:04,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,497 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2018-09-26 08:11:04,497 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1321157890, now seen corresponding path program 88 times [2018-09-26 08:11:04,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:04,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:04,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:11:04,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:11:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:11:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:04,646 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 49 states. [2018-09-26 08:11:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,784 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-09-26 08:11:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:11:04,784 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 138 [2018-09-26 08:11:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,786 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:11:04,786 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:11:04,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:11:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:11:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-09-26 08:11:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:11:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-26 08:11:04,804 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-26 08:11:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,805 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-26 08:11:04,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:11:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-26 08:11:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:11:04,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,806 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2018-09-26 08:11:04,806 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1677521302, now seen corresponding path program 89 times [2018-09-26 08:11:04,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:05,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:11:05,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:11:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:11:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:11:05,143 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 94 states. [2018-09-26 08:11:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:05,801 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-09-26 08:11:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:11:05,802 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 140 [2018-09-26 08:11:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:05,803 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:11:05,803 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:11:05,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:11:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:11:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:11:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:11:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-09-26 08:11:05,819 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-09-26 08:11:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:05,819 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-09-26 08:11:05,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:11:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-09-26 08:11:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:11:05,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:05,820 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2018-09-26 08:11:05,821 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:05,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash -843219869, now seen corresponding path program 90 times [2018-09-26 08:11:05,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:06,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:06,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:11:06,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:11:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:11:06,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:06,003 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 50 states. [2018-09-26 08:11:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:06,184 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-09-26 08:11:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:11:06,184 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 141 [2018-09-26 08:11:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:06,185 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:11:06,185 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:11:06,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:11:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:11:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-09-26 08:11:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:11:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-09-26 08:11:06,201 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-09-26 08:11:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:06,202 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-09-26 08:11:06,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:11:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-09-26 08:11:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:11:06,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:06,203 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2018-09-26 08:11:06,203 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:06,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1414590859, now seen corresponding path program 91 times [2018-09-26 08:11:06,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:06,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:06,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:11:06,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:11:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:11:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:11:06,441 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 96 states. [2018-09-26 08:11:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:07,128 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-09-26 08:11:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:11:07,129 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 143 [2018-09-26 08:11:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:07,130 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:11:07,130 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:11:07,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:11:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:11:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:11:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:11:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-26 08:11:07,145 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-09-26 08:11:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:07,145 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-26 08:11:07,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:11:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-26 08:11:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:11:07,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:07,146 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2018-09-26 08:11:07,147 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:07,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:07,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1112839410, now seen corresponding path program 92 times [2018-09-26 08:11:07,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:07,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:07,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:11:07,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:11:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:11:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:07,305 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 51 states. [2018-09-26 08:11:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:07,468 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-09-26 08:11:07,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:11:07,468 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 144 [2018-09-26 08:11:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:07,469 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:11:07,469 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:11:07,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:11:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:11:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-09-26 08:11:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:11:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:11:07,488 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-09-26 08:11:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:07,488 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:11:07,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:11:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:11:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:11:07,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:07,489 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2018-09-26 08:11:07,489 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:07,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash -8117670, now seen corresponding path program 93 times [2018-09-26 08:11:07,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:07,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:07,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:11:07,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:11:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:11:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:11:07,738 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 98 states. [2018-09-26 08:11:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:08,217 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-09-26 08:11:08,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:11:08,217 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 146 [2018-09-26 08:11:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:08,218 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:11:08,218 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:11:08,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:11:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:11:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:11:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:11:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-09-26 08:11:08,239 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-09-26 08:11:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:08,239 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-09-26 08:11:08,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:11:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-09-26 08:11:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:11:08,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:08,240 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2018-09-26 08:11:08,240 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:08,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash -118984301, now seen corresponding path program 94 times [2018-09-26 08:11:08,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:08,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:11:08,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:11:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:11:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:08,394 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 52 states. [2018-09-26 08:11:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:08,566 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-09-26 08:11:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:11:08,567 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 147 [2018-09-26 08:11:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:08,567 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:11:08,568 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:11:08,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:11:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:11:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-09-26 08:11:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:11:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-09-26 08:11:08,582 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-09-26 08:11:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:08,583 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-09-26 08:11:08,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:11:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-09-26 08:11:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:11:08,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:08,584 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2018-09-26 08:11:08,584 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:08,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1620269755, now seen corresponding path program 95 times [2018-09-26 08:11:08,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:08,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:11:08,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:11:08,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:11:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:11:08,825 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 100 states. [2018-09-26 08:11:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:09,485 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-09-26 08:11:09,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:11:09,486 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 149 [2018-09-26 08:11:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:09,486 INFO L225 Difference]: With dead ends: 252 [2018-09-26 08:11:09,487 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:11:09,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:11:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:11:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:11:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:11:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-26 08:11:09,502 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2018-09-26 08:11:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:09,503 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-26 08:11:09,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:11:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-26 08:11:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:11:09,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:09,504 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2018-09-26 08:11:09,504 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:09,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1622316258, now seen corresponding path program 96 times [2018-09-26 08:11:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:09,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:09,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:11:09,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:11:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:11:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:09,660 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 53 states. [2018-09-26 08:11:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:09,802 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-09-26 08:11:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:11:09,802 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 150 [2018-09-26 08:11:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:09,804 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:11:09,804 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:11:09,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:11:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:11:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-09-26 08:11:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:11:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-09-26 08:11:09,820 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-09-26 08:11:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:09,821 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-09-26 08:11:09,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:11:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-09-26 08:11:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:11:09,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:09,821 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2018-09-26 08:11:09,822 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:09,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -27138486, now seen corresponding path program 97 times [2018-09-26 08:11:09,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:10,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:10,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:11:10,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:11:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:11:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:11:10,131 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 102 states. [2018-09-26 08:11:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:10,842 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-09-26 08:11:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:11:10,842 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 152 [2018-09-26 08:11:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:10,843 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:11:10,843 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:11:10,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:11:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:11:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:11:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:11:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-09-26 08:11:10,866 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-09-26 08:11:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:10,867 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-09-26 08:11:10,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:11:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-09-26 08:11:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:11:10,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:10,868 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2018-09-26 08:11:10,868 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:10,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash 810690243, now seen corresponding path program 98 times [2018-09-26 08:11:10,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:11,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:11,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:11:11,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:11:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:11:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:11,043 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 54 states. [2018-09-26 08:11:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:11,190 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-09-26 08:11:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:11:11,190 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 153 [2018-09-26 08:11:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:11,191 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:11:11,192 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:11:11,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:11:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:11:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-09-26 08:11:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:11:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-09-26 08:11:11,229 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2018-09-26 08:11:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:11,230 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-09-26 08:11:11,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:11:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-09-26 08:11:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:11:11,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:11,231 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2018-09-26 08:11:11,231 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:11,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:11,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1684308971, now seen corresponding path program 99 times [2018-09-26 08:11:11,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:11,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:11,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:11:11,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:11:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:11:11,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:11:11,615 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 104 states. [2018-09-26 08:11:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:12,339 INFO L93 Difference]: Finished difference Result 262 states and 264 transitions. [2018-09-26 08:11:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:11:12,339 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 155 [2018-09-26 08:11:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:12,341 INFO L225 Difference]: With dead ends: 262 [2018-09-26 08:11:12,341 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:11:12,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:11:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:11:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:11:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:11:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-09-26 08:11:12,365 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2018-09-26 08:11:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:12,366 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-09-26 08:11:12,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:11:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-09-26 08:11:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:11:12,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:12,367 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2018-09-26 08:11:12,367 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:12,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash -909949742, now seen corresponding path program 100 times [2018-09-26 08:11:12,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:12,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:12,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:11:12,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:11:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:11:12,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:12,553 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 55 states. [2018-09-26 08:11:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:12,722 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-09-26 08:11:12,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:11:12,722 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 156 [2018-09-26 08:11:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:12,723 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:11:12,723 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:11:12,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:11:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:11:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-09-26 08:11:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:11:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-26 08:11:12,748 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-09-26 08:11:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:12,749 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-26 08:11:12,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:11:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-26 08:11:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:11:12,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:12,750 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2018-09-26 08:11:12,750 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:12,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:12,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1711692346, now seen corresponding path program 101 times [2018-09-26 08:11:12,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:13,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:13,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:11:13,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:11:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:11:13,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:11:13,065 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 106 states. [2018-09-26 08:11:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:13,975 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-09-26 08:11:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:11:13,975 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 158 [2018-09-26 08:11:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:13,976 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:11:13,976 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:11:13,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:11:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:11:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:11:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:11:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-09-26 08:11:13,995 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-09-26 08:11:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:13,995 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-09-26 08:11:13,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:11:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-09-26 08:11:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:11:13,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:13,996 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2018-09-26 08:11:13,996 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:13,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:13,996 INFO L82 PathProgramCache]: Analyzing trace with hash -208102413, now seen corresponding path program 102 times [2018-09-26 08:11:13,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:14,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:14,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:11:14,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:11:14,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:11:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:14,164 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 56 states. [2018-09-26 08:11:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:14,306 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2018-09-26 08:11:14,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:11:14,306 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 159 [2018-09-26 08:11:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:14,307 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:11:14,307 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:11:14,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:11:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:11:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-09-26 08:11:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:11:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-09-26 08:11:14,331 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2018-09-26 08:11:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:14,331 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-09-26 08:11:14,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:11:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-09-26 08:11:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:11:14,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:14,332 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2018-09-26 08:11:14,333 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:14,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:14,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1877110043, now seen corresponding path program 103 times [2018-09-26 08:11:14,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:14,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:14,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:11:14,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:11:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:11:14,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:11:14,754 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 108 states. [2018-09-26 08:11:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:15,229 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-09-26 08:11:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:11:15,229 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 161 [2018-09-26 08:11:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:15,230 INFO L225 Difference]: With dead ends: 272 [2018-09-26 08:11:15,230 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:11:15,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:11:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:11:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:11:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:11:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:11:15,252 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2018-09-26 08:11:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:15,253 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:11:15,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:11:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:11:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:11:15,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:15,254 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2018-09-26 08:11:15,254 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:15,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1055958210, now seen corresponding path program 104 times [2018-09-26 08:11:15,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:15,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:15,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:11:15,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:11:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:11:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:11:15,441 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 57 states. [2018-09-26 08:11:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:15,625 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-09-26 08:11:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:11:15,625 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 162 [2018-09-26 08:11:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:15,626 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:11:15,626 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:11:15,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:11:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:11:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-09-26 08:11:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:11:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-09-26 08:11:15,645 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-09-26 08:11:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:15,645 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-09-26 08:11:15,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:11:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-09-26 08:11:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:11:15,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:15,646 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2018-09-26 08:11:15,647 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:15,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1163623978, now seen corresponding path program 105 times [2018-09-26 08:11:15,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:15,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:15,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:11:15,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:11:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:11:15,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:11:15,958 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 110 states. [2018-09-26 08:11:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:16,795 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-09-26 08:11:16,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:11:16,795 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 164 [2018-09-26 08:11:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:16,795 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:11:16,796 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:11:16,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:11:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:11:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:11:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:11:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-09-26 08:11:16,815 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-09-26 08:11:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:16,815 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-09-26 08:11:16,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:11:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-09-26 08:11:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:11:16,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:16,816 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2018-09-26 08:11:16,817 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:16,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1931882205, now seen corresponding path program 106 times [2018-09-26 08:11:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:17,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:17,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:11:17,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:11:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:11:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:11:17,007 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 58 states. [2018-09-26 08:11:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:17,194 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-09-26 08:11:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:11:17,194 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 165 [2018-09-26 08:11:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:17,195 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:11:17,195 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:11:17,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:11:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:11:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-09-26 08:11:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:11:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-09-26 08:11:17,213 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2018-09-26 08:11:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:17,214 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-09-26 08:11:17,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:11:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-09-26 08:11:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:11:17,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:17,215 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2018-09-26 08:11:17,215 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:17,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:17,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1112861109, now seen corresponding path program 107 times [2018-09-26 08:11:17,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:17,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:17,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:11:17,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:11:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:11:17,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:11:17,546 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 112 states. [2018-09-26 08:11:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:18,395 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-09-26 08:11:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:11:18,395 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 167 [2018-09-26 08:11:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:18,396 INFO L225 Difference]: With dead ends: 282 [2018-09-26 08:11:18,396 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:11:18,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6381, Invalid=21341, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:11:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:11:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:11:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:11:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-09-26 08:11:18,418 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 167 [2018-09-26 08:11:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:18,418 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-09-26 08:11:18,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:11:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-09-26 08:11:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:11:18,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:18,419 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1, 1, 1] [2018-09-26 08:11:18,419 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:18,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2094746446, now seen corresponding path program 108 times [2018-09-26 08:11:18,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:18,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:18,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:11:18,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:11:18,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:11:18,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:11:18,636 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 59 states. [2018-09-26 08:11:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:18,796 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-09-26 08:11:18,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:11:18,797 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 168 [2018-09-26 08:11:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:18,797 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:11:18,797 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:11:18,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4959, Invalid=8151, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:11:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:11:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-09-26 08:11:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:11:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:11:18,816 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-09-26 08:11:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:18,816 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:11:18,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:11:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:11:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:11:18,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:18,817 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1] [2018-09-26 08:11:18,817 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:18,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1288393242, now seen corresponding path program 109 times [2018-09-26 08:11:18,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:19,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:19,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:11:19,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:11:19,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:11:19,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:11:19,133 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 114 states. [2018-09-26 08:11:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:20,138 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-09-26 08:11:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:11:20,138 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 170 [2018-09-26 08:11:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:20,138 INFO L225 Difference]: With dead ends: 287 [2018-09-26 08:11:20,138 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:11:20,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6609, Invalid=22121, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:11:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:11:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:11:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:11:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-09-26 08:11:20,157 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-09-26 08:11:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:20,157 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-09-26 08:11:20,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:11:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-09-26 08:11:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:11:20,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:20,158 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1, 1, 1] [2018-09-26 08:11:20,158 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:20,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1330395565, now seen corresponding path program 110 times [2018-09-26 08:11:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:20,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:20,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:11:20,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:11:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:11:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:11:20,347 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 60 states. [2018-09-26 08:11:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:20,506 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2018-09-26 08:11:20,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:11:20,506 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 171 [2018-09-26 08:11:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:20,507 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:11:20,507 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:11:20,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5133, Invalid=8439, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:11:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:11:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-09-26 08:11:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:11:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-09-26 08:11:20,531 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2018-09-26 08:11:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:20,531 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-09-26 08:11:20,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:11:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-09-26 08:11:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:11:20,532 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:20,532 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1] [2018-09-26 08:11:20,533 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:20,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1390182267, now seen corresponding path program 111 times [2018-09-26 08:11:20,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:20,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:20,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:11:20,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:11:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:11:20,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:11:20,927 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 116 states. [2018-09-26 08:11:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:21,883 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-09-26 08:11:21,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:11:21,884 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 173 [2018-09-26 08:11:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:21,884 INFO L225 Difference]: With dead ends: 292 [2018-09-26 08:11:21,884 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:11:21,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6841, Invalid=22915, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:11:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:11:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:11:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:11:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-26 08:11:21,906 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2018-09-26 08:11:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:21,906 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-26 08:11:21,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:11:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-26 08:11:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:11:21,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:21,907 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1, 1, 1] [2018-09-26 08:11:21,907 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:21,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1161202526, now seen corresponding path program 112 times [2018-09-26 08:11:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:22,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:22,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:11:22,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:11:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:11:22,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:11:22,094 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 61 states. [2018-09-26 08:11:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:22,268 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-09-26 08:11:22,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:11:22,268 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 174 [2018-09-26 08:11:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:22,268 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:11:22,268 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:11:22,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5310, Invalid=8732, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:11:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:11:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-09-26 08:11:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:11:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-09-26 08:11:22,287 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-09-26 08:11:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:22,288 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-09-26 08:11:22,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:11:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-09-26 08:11:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:11:22,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:22,288 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1] [2018-09-26 08:11:22,289 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:22,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 775935498, now seen corresponding path program 113 times [2018-09-26 08:11:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:22,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:22,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:11:22,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:11:22,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:11:22,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:11:22,628 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 118 states. [2018-09-26 08:11:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:23,823 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-09-26 08:11:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:11:23,823 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 176 [2018-09-26 08:11:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:23,824 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:11:23,824 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:11:23,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7077, Invalid=23723, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:11:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:11:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-26 08:11:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:11:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-09-26 08:11:23,844 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-09-26 08:11:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:23,844 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-09-26 08:11:23,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:11:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-09-26 08:11:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:11:23,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:23,845 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1, 1, 1] [2018-09-26 08:11:23,845 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:23,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 507804547, now seen corresponding path program 114 times [2018-09-26 08:11:23,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:24,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:24,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:11:24,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:11:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:11:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:11:24,106 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 62 states. [2018-09-26 08:11:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:24,291 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-09-26 08:11:24,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:11:24,291 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 177 [2018-09-26 08:11:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:24,292 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:11:24,292 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:11:24,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3422 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5490, Invalid=9030, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:11:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:11:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-09-26 08:11:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:11:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-09-26 08:11:24,316 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2018-09-26 08:11:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:24,316 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-09-26 08:11:24,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:11:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-09-26 08:11:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:11:24,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:24,317 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1] [2018-09-26 08:11:24,317 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:24,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1626036053, now seen corresponding path program 115 times [2018-09-26 08:11:24,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:24,656 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:24,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:11:24,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:11:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:11:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:11:24,658 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 120 states. [2018-09-26 08:11:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,451 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-09-26 08:11:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:11:25,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 179 [2018-09-26 08:11:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,451 INFO L225 Difference]: With dead ends: 302 [2018-09-26 08:11:25,452 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:11:25,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5075 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7317, Invalid=24545, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:11:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:11:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:11:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:11:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-09-26 08:11:25,468 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 179 [2018-09-26 08:11:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,469 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-09-26 08:11:25,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:11:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-09-26 08:11:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:11:25,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,469 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1, 1, 1] [2018-09-26 08:11:25,469 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -876026734, now seen corresponding path program 116 times [2018-09-26 08:11:25,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,717 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:11:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:11:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:11:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:11:25,718 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 63 states. [2018-09-26 08:11:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,897 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-09-26 08:11:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:11:25,898 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 180 [2018-09-26 08:11:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,898 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:11:25,898 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:11:25,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5673, Invalid=9333, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:11:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:11:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-09-26 08:11:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:11:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-26 08:11:25,925 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-09-26 08:11:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,925 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-26 08:11:25,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:11:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-26 08:11:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:11:25,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,926 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1] [2018-09-26 08:11:25,926 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash -48035334, now seen corresponding path program 117 times [2018-09-26 08:11:25,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:11:26,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:11:26,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:11:26,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:11:26,272 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 122 states. [2018-09-26 08:11:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,073 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-09-26 08:11:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:11:27,073 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 182 [2018-09-26 08:11:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,074 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:11:27,074 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:11:27,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7561, Invalid=25381, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:11:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:11:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:11:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:11:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-09-26 08:11:27,102 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 182 [2018-09-26 08:11:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,102 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-09-26 08:11:27,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:11:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-09-26 08:11:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:11:27,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,104 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1, 1, 1] [2018-09-26 08:11:27,104 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1059713203, now seen corresponding path program 118 times [2018-09-26 08:11:27,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,340 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:11:27,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:11:27,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:11:27,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:11:27,342 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 64 states. [2018-09-26 08:11:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,549 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-09-26 08:11:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:11:27,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 183 [2018-09-26 08:11:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,550 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:11:27,550 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:11:27,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3660 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5859, Invalid=9641, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:11:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:11:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-09-26 08:11:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:11:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-09-26 08:11:27,578 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2018-09-26 08:11:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,579 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-09-26 08:11:27,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:11:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-09-26 08:11:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:11:27,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,580 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1] [2018-09-26 08:11:27,580 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash 477204955, now seen corresponding path program 119 times [2018-09-26 08:11:27,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:28,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:11:28,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:11:28,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:11:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:11:28,021 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 124 states. [2018-09-26 08:11:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,820 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2018-09-26 08:11:28,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:11:28,820 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 185 [2018-09-26 08:11:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,821 INFO L225 Difference]: With dead ends: 312 [2018-09-26 08:11:28,821 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:11:28,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7809, Invalid=26231, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:11:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:11:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:11:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:11:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:11:28,851 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 185 [2018-09-26 08:11:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,851 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:11:28,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:11:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:11:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:11:28,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,853 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1, 1, 1] [2018-09-26 08:11:28,853 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1114831742, now seen corresponding path program 120 times [2018-09-26 08:11:28,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:11:29,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:11:29,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:11:29,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:11:29,102 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 65 states. [2018-09-26 08:11:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:29,318 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-09-26 08:11:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:11:29,318 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 186 [2018-09-26 08:11:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:29,319 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:11:29,319 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:11:29,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:11:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:11:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-09-26 08:11:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:11:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-09-26 08:11:29,351 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-09-26 08:11:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,351 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-09-26 08:11:29,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:11:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-09-26 08:11:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:11:29,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,352 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1] [2018-09-26 08:11:29,352 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1906381334, now seen corresponding path program 121 times [2018-09-26 08:11:29,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:11:29,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:11:29,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:11:29,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4031, Invalid=11719, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:11:29,919 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 126 states. [2018-09-26 08:11:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,669 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-09-26 08:11:30,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:11:30,669 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 188 [2018-09-26 08:11:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,670 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:11:30,670 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:11:30,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8061, Invalid=27095, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:11:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:11:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-09-26 08:11:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:11:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-09-26 08:11:30,692 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 188 [2018-09-26 08:11:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,693 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-09-26 08:11:30,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:11:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-09-26 08:11:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:11:30,693 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,694 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1, 1, 1] [2018-09-26 08:11:30,694 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -947771933, now seen corresponding path program 122 times [2018-09-26 08:11:30,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:30,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:11:30,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:11:30,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:11:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:11:30,996 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 66 states. [2018-09-26 08:11:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,306 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2018-09-26 08:11:31,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:11:31,306 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 189 [2018-09-26 08:11:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,307 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:11:31,307 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:11:31,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3906 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6240, Invalid=10272, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:11:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:11:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2018-09-26 08:11:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:11:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-09-26 08:11:31,338 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2018-09-26 08:11:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,339 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-09-26 08:11:31,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:11:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-09-26 08:11:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 08:11:31,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,340 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1] [2018-09-26 08:11:31,340 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash -275694837, now seen corresponding path program 123 times [2018-09-26 08:11:31,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:31,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:11:31,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:11:31,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:11:31,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:11:31,749 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 128 states. [2018-09-26 08:11:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,581 INFO L93 Difference]: Finished difference Result 322 states and 324 transitions. [2018-09-26 08:11:32,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:11:32,581 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 191 [2018-09-26 08:11:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,582 INFO L225 Difference]: With dead ends: 322 [2018-09-26 08:11:32,582 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:11:32,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5797 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8317, Invalid=27973, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:11:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:11:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:11:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:11:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-09-26 08:11:32,605 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 191 [2018-09-26 08:11:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:32,606 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-09-26 08:11:32,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:11:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-09-26 08:11:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:11:32,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:32,607 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1, 1, 1] [2018-09-26 08:11:32,607 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:32,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:32,608 INFO L82 PathProgramCache]: Analyzing trace with hash 419419250, now seen corresponding path program 124 times [2018-09-26 08:11:32,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:32,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:32,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:11:32,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:11:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:11:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:11:32,860 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 67 states. [2018-09-26 08:11:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,070 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-09-26 08:11:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:11:33,070 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 192 [2018-09-26 08:11:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,071 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:11:33,071 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:11:33,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6435, Invalid=10595, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:11:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:11:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-09-26 08:11:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:11:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:11:33,093 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-09-26 08:11:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,093 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:11:33,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:11:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:11:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:11:33,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,095 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1] [2018-09-26 08:11:33,095 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash -664960550, now seen corresponding path program 125 times [2018-09-26 08:11:33,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:33,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:11:33,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:11:33,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:11:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:11:33,494 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 130 states. [2018-09-26 08:11:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,233 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-09-26 08:11:34,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:11:34,234 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 194 [2018-09-26 08:11:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,234 INFO L225 Difference]: With dead ends: 327 [2018-09-26 08:11:34,234 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:11:34,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8577, Invalid=28865, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:11:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:11:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-09-26 08:11:34,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:11:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-09-26 08:11:34,260 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 194 [2018-09-26 08:11:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,260 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-09-26 08:11:34,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:11:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-09-26 08:11:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:11:34,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,261 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1, 1, 1] [2018-09-26 08:11:34,262 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1441471251, now seen corresponding path program 126 times [2018-09-26 08:11:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2080 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:34,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:34,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:11:34,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:11:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:11:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:11:34,517 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 68 states. [2018-09-26 08:11:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,746 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2018-09-26 08:11:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:11:34,747 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 195 [2018-09-26 08:11:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,748 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:11:34,748 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:11:34,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6633, Invalid=10923, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:11:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:11:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-09-26 08:11:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:11:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-09-26 08:11:34,779 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2018-09-26 08:11:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,780 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-09-26 08:11:34,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:11:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-09-26 08:11:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:11:34,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,781 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1] [2018-09-26 08:11:34,781 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2020498373, now seen corresponding path program 127 times [2018-09-26 08:11:34,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 4160 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:35,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:35,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:11:35,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:11:35,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:11:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4421, Invalid=12871, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:11:35,218 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 132 states. [2018-09-26 08:11:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:35,996 INFO L93 Difference]: Finished difference Result 332 states and 334 transitions. [2018-09-26 08:11:35,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:11:35,996 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 197 [2018-09-26 08:11:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:35,997 INFO L225 Difference]: With dead ends: 332 [2018-09-26 08:11:35,997 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:11:35,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8841, Invalid=29771, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:11:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:11:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:11:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:11:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-26 08:11:36,023 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 197 [2018-09-26 08:11:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,023 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-26 08:11:36,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:11:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-26 08:11:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:11:36,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,024 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 1, 1, 1, 1] [2018-09-26 08:11:36,024 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1217090658, now seen corresponding path program 128 times [2018-09-26 08:11:36,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2145 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:36,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:36,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:11:36,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:11:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:11:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:11:36,289 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 69 states. [2018-09-26 08:11:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,511 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-09-26 08:11:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:11:36,511 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 198 [2018-09-26 08:11:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,512 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:11:36,512 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:11:36,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6834, Invalid=11256, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:11:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:11:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-09-26 08:11:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:11:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-09-26 08:11:36,543 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-09-26 08:11:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,543 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-09-26 08:11:36,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:11:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-09-26 08:11:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:11:36,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,545 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1] [2018-09-26 08:11:36,545 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1393083850, now seen corresponding path program 129 times [2018-09-26 08:11:36,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 4290 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:37,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:11:37,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:11:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:11:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:11:37,093 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 134 states. [2018-09-26 08:11:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:38,026 INFO L93 Difference]: Finished difference Result 337 states and 339 transitions. [2018-09-26 08:11:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:11:38,027 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 200 [2018-09-26 08:11:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:38,027 INFO L225 Difference]: With dead ends: 337 [2018-09-26 08:11:38,027 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:11:38,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9109, Invalid=30691, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:11:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:11:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-26 08:11:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:11:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-09-26 08:11:38,052 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 200 [2018-09-26 08:11:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,052 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-09-26 08:11:38,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:11:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-09-26 08:11:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:11:38,053 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,053 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 1, 1, 1, 1] [2018-09-26 08:11:38,053 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 327340099, now seen corresponding path program 130 times [2018-09-26 08:11:38,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2211 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:38,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:38,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:11:38,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:11:38,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:11:38,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:11:38,329 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 70 states. [2018-09-26 08:11:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:38,709 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2018-09-26 08:11:38,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:11:38,709 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 201 [2018-09-26 08:11:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:38,710 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:11:38,710 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:11:38,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4422 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7038, Invalid=11594, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:11:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:11:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-09-26 08:11:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:11:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-09-26 08:11:38,732 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2018-09-26 08:11:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,733 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-09-26 08:11:38,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:11:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-09-26 08:11:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-26 08:11:38,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,734 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1] [2018-09-26 08:11:38,734 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1041288555, now seen corresponding path program 131 times [2018-09-26 08:11:38,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4422 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:39,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:39,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:11:39,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:11:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:11:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=13669, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:11:39,173 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 136 states. [2018-09-26 08:11:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,135 INFO L93 Difference]: Finished difference Result 342 states and 344 transitions. [2018-09-26 08:11:40,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:11:40,135 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 203 [2018-09-26 08:11:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,136 INFO L225 Difference]: With dead ends: 342 [2018-09-26 08:11:40,136 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:11:40,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6567 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9381, Invalid=31625, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:11:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:11:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:11:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:11:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-09-26 08:11:40,169 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 203 [2018-09-26 08:11:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:40,169 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-09-26 08:11:40,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:11:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-09-26 08:11:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:11:40,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:40,171 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 1, 1, 1, 1] [2018-09-26 08:11:40,171 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:40,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash -132545454, now seen corresponding path program 132 times [2018-09-26 08:11:40,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2278 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:40,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:40,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:11:40,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:11:40,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:11:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:11:40,503 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 71 states. [2018-09-26 08:11:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,743 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-09-26 08:11:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:11:40,744 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 204 [2018-09-26 08:11:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,744 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:11:40,744 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:11:40,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:11:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:11:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-09-26 08:11:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:11:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-26 08:11:40,776 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-09-26 08:11:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:40,776 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-26 08:11:40,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:11:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-26 08:11:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:11:40,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:40,778 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1] [2018-09-26 08:11:40,778 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:40,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1472903610, now seen corresponding path program 133 times [2018-09-26 08:11:40,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 4556 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:41,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:41,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:11:41,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:11:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:11:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4829, Invalid=14077, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:11:41,242 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 138 states. [2018-09-26 08:11:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:41,861 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-09-26 08:11:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:11:41,861 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 206 [2018-09-26 08:11:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:41,862 INFO L225 Difference]: With dead ends: 347 [2018-09-26 08:11:41,862 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:11:41,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6767 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9657, Invalid=32573, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:11:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:11:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-09-26 08:11:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:11:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-09-26 08:11:41,892 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 206 [2018-09-26 08:11:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:41,892 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-09-26 08:11:41,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:11:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-09-26 08:11:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:11:41,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:41,893 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 1, 1, 1, 1] [2018-09-26 08:11:41,894 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:41,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:41,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1407665523, now seen corresponding path program 134 times [2018-09-26 08:11:41,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2346 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:42,206 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:11:42,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:11:42,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:11:42,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:11:42,207 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 72 states. [2018-09-26 08:11:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:42,461 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-09-26 08:11:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:11:42,461 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 207 [2018-09-26 08:11:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:42,461 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:11:42,462 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:11:42,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4692 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7455, Invalid=12285, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:11:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:11:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-09-26 08:11:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:11:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-09-26 08:11:42,487 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2018-09-26 08:11:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:42,487 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-09-26 08:11:42,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:11:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-09-26 08:11:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:11:42,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:42,488 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1] [2018-09-26 08:11:42,488 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:42,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash -148064613, now seen corresponding path program 135 times [2018-09-26 08:11:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4692 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:42,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:11:42,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:11:42,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:11:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4969, Invalid=14491, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:11:42,977 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 140 states. [2018-09-26 08:11:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:43,962 INFO L93 Difference]: Finished difference Result 352 states and 354 transitions. [2018-09-26 08:11:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:11:43,962 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 209 [2018-09-26 08:11:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:43,962 INFO L225 Difference]: With dead ends: 352 [2018-09-26 08:11:43,962 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:11:43,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6970 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9937, Invalid=33535, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:11:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:11:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:11:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:11:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:11:43,988 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 209 [2018-09-26 08:11:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:43,988 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:11:43,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:11:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:11:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:11:43,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:43,990 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 1, 1, 1, 1] [2018-09-26 08:11:43,990 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:43,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:43,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1964270658, now seen corresponding path program 136 times [2018-09-26 08:11:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2415 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:44,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:11:44,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:11:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:11:44,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:11:44,285 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 73 states. [2018-09-26 08:11:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:44,525 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-09-26 08:11:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:11:44,525 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 210 [2018-09-26 08:11:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:44,526 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:11:44,526 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:11:44,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7668, Invalid=12638, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:11:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:11:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2018-09-26 08:11:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:11:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-09-26 08:11:44,560 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-09-26 08:11:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:44,560 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-09-26 08:11:44,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:11:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-09-26 08:11:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:11:44,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:44,561 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1] [2018-09-26 08:11:44,561 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:44,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2121441878, now seen corresponding path program 137 times [2018-09-26 08:11:44,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4830 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:45,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:45,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:11:45,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:11:45,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:11:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5111, Invalid=14911, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:11:45,043 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 142 states. [2018-09-26 08:11:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,162 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2018-09-26 08:11:46,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:11:46,163 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 212 [2018-09-26 08:11:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,163 INFO L225 Difference]: With dead ends: 357 [2018-09-26 08:11:46,163 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:11:46,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10221, Invalid=34511, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:11:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:11:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-09-26 08:11:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:11:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-09-26 08:11:46,198 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 212 [2018-09-26 08:11:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,199 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-09-26 08:11:46,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:11:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-09-26 08:11:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:11:46,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,200 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 1, 1, 1, 1] [2018-09-26 08:11:46,200 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash 892762787, now seen corresponding path program 138 times [2018-09-26 08:11:46,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 2485 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:46,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:11:46,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:11:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:11:46,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:11:46,509 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 74 states. [2018-09-26 08:11:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,771 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-09-26 08:11:46,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:11:46,771 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 213 [2018-09-26 08:11:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,771 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:11:46,771 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:11:46,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4970 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7884, Invalid=12996, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:11:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:11:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-09-26 08:11:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:11:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-09-26 08:11:46,800 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 213 [2018-09-26 08:11:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,801 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-09-26 08:11:46,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:11:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-09-26 08:11:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:11:46,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,802 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1, 1] [2018-09-26 08:11:46,802 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1048354869, now seen corresponding path program 139 times [2018-09-26 08:11:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 4970 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:47,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:11:47,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:11:47,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:11:47,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=15337, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:11:47,393 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 144 states. [2018-09-26 08:11:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,141 INFO L93 Difference]: Finished difference Result 362 states and 364 transitions. [2018-09-26 08:11:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:11:48,141 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 215 [2018-09-26 08:11:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,142 INFO L225 Difference]: With dead ends: 362 [2018-09-26 08:11:48,142 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:11:48,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7385 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10509, Invalid=35501, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:11:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:11:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:11:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:11:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-09-26 08:11:48,168 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 215 [2018-09-26 08:11:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,169 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-09-26 08:11:48,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:11:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-09-26 08:11:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:11:48,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,169 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 1, 1, 1, 1] [2018-09-26 08:11:48,170 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash 241562674, now seen corresponding path program 140 times [2018-09-26 08:11:48,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 2556 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:48,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:11:48,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:11:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:11:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:11:48,491 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 75 states. [2018-09-26 08:11:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,749 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-09-26 08:11:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:11:48,750 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 216 [2018-09-26 08:11:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,750 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:11:48,750 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:11:48,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8103, Invalid=13359, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:11:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:11:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2018-09-26 08:11:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:11:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:11:48,776 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-09-26 08:11:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,776 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:11:48,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:11:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:11:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:11:48,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,777 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1, 1, 1] [2018-09-26 08:11:48,777 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 213561754, now seen corresponding path program 141 times [2018-09-26 08:11:48,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 5112 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:49,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:11:49,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:11:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:11:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5401, Invalid=15769, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:11:49,248 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 146 states. [2018-09-26 08:11:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,021 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-09-26 08:11:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:11:50,022 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 218 [2018-09-26 08:11:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,022 INFO L225 Difference]: With dead ends: 367 [2018-09-26 08:11:50,022 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:11:50,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7597 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10801, Invalid=36505, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:11:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:11:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-09-26 08:11:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:11:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-09-26 08:11:50,047 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 218 [2018-09-26 08:11:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,047 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-09-26 08:11:50,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:11:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-09-26 08:11:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:11:50,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,048 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 1, 1, 1, 1] [2018-09-26 08:11:50,048 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1074687955, now seen corresponding path program 142 times [2018-09-26 08:11:50,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 2628 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:50,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:11:50,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:11:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:11:50,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:11:50,335 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 76 states. [2018-09-26 08:11:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,574 INFO L93 Difference]: Finished difference Result 228 states and 229 transitions. [2018-09-26 08:11:50,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:11:50,574 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 219 [2018-09-26 08:11:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,575 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:11:50,575 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:11:50,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8325, Invalid=13727, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:11:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:11:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2018-09-26 08:11:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:11:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-09-26 08:11:50,606 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 219 [2018-09-26 08:11:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,606 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-09-26 08:11:50,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:11:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-09-26 08:11:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:11:50,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,607 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1, 1, 1] [2018-09-26 08:11:50,607 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1983039739, now seen corresponding path program 143 times [2018-09-26 08:11:50,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 5256 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:51,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:11:51,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:11:51,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:11:51,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5549, Invalid=16207, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:11:51,136 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 148 states. [2018-09-26 08:11:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,074 INFO L93 Difference]: Finished difference Result 372 states and 374 transitions. [2018-09-26 08:11:52,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:11:52,075 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 221 [2018-09-26 08:11:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,076 INFO L225 Difference]: With dead ends: 372 [2018-09-26 08:11:52,076 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:11:52,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11097, Invalid=37523, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:11:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:11:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:11:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:11:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-26 08:11:52,105 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 221 [2018-09-26 08:11:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,105 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-26 08:11:52,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:11:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-26 08:11:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:11:52,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,106 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 1, 1, 1, 1] [2018-09-26 08:11:52,106 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1954034722, now seen corresponding path program 144 times [2018-09-26 08:11:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 2701 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:52,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:11:52,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:11:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:11:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:11:52,464 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 77 states. [2018-09-26 08:11:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,719 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2018-09-26 08:11:52,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:11:52,719 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 222 [2018-09-26 08:11:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,720 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:11:52,720 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:11:52,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8550, Invalid=14100, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:11:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:11:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2018-09-26 08:11:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:11:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-09-26 08:11:52,747 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2018-09-26 08:11:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,748 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-09-26 08:11:52,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:11:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-09-26 08:11:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:11:52,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,749 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1, 1, 1] [2018-09-26 08:11:52,749 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,749 INFO L82 PathProgramCache]: Analyzing trace with hash 926725514, now seen corresponding path program 145 times [2018-09-26 08:11:52,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8103 backedges. 5402 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:53,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:11:53,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:11:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:11:53,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5699, Invalid=16651, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:11:53,288 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 150 states. [2018-09-26 08:11:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:54,593 INFO L93 Difference]: Finished difference Result 377 states and 379 transitions. [2018-09-26 08:11:54,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:11:54,594 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 224 [2018-09-26 08:11:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:54,594 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:11:54,594 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:11:54,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8030 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11397, Invalid=38555, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:11:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:11:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-09-26 08:11:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:11:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-09-26 08:11:54,624 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 224 [2018-09-26 08:11:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,624 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-09-26 08:11:54,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:11:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-09-26 08:11:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:11:54,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,625 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 1, 1, 1, 1] [2018-09-26 08:11:54,625 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 126690563, now seen corresponding path program 146 times [2018-09-26 08:11:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 2775 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:54,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:11:54,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:11:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:11:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:11:54,961 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 78 states. [2018-09-26 08:11:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,245 INFO L93 Difference]: Finished difference Result 234 states and 235 transitions. [2018-09-26 08:11:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:11:55,245 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 225 [2018-09-26 08:11:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,246 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:11:55,246 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:11:55,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5550 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8778, Invalid=14478, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:11:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:11:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2018-09-26 08:11:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:11:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 229 transitions. [2018-09-26 08:11:55,284 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 229 transitions. Word has length 225 [2018-09-26 08:11:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,284 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 229 transitions. [2018-09-26 08:11:55,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:11:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 229 transitions. [2018-09-26 08:11:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-26 08:11:55,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,285 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1, 1, 1] [2018-09-26 08:11:55,286 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1490612779, now seen corresponding path program 147 times [2018-09-26 08:11:55,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 5550 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:55,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:55,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:11:55,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:11:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:11:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5851, Invalid=17101, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:11:55,886 INFO L87 Difference]: Start difference. First operand 228 states and 229 transitions. Second operand 152 states. [2018-09-26 08:11:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,218 INFO L93 Difference]: Finished difference Result 382 states and 384 transitions. [2018-09-26 08:11:57,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:11:57,218 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 227 [2018-09-26 08:11:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,218 INFO L225 Difference]: With dead ends: 382 [2018-09-26 08:11:57,219 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:11:57,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11701, Invalid=39601, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:11:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:11:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:11:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:11:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-09-26 08:11:57,249 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 227 [2018-09-26 08:11:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,249 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-09-26 08:11:57,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:11:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-09-26 08:11:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:11:57,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,250 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 1, 1, 1, 1] [2018-09-26 08:11:57,250 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash 422913042, now seen corresponding path program 148 times [2018-09-26 08:11:57,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 2850 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:57,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:57,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:11:57,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:11:57,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:11:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:11:57,583 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 79 states. [2018-09-26 08:11:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,855 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-09-26 08:11:57,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:11:57,856 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 228 [2018-09-26 08:11:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,856 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:11:57,856 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:11:57,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9009, Invalid=14861, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:11:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:11:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-09-26 08:11:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:11:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-09-26 08:11:57,884 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2018-09-26 08:11:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,885 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-09-26 08:11:57,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:11:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-09-26 08:11:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:11:57,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,886 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1, 1, 1] [2018-09-26 08:11:57,886 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1602393734, now seen corresponding path program 149 times [2018-09-26 08:11:57,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8550 backedges. 5700 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:58,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:58,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:11:58,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:11:58,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:11:58,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6005, Invalid=17557, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:11:58,544 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 154 states. [2018-09-26 08:11:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:59,839 INFO L93 Difference]: Finished difference Result 387 states and 389 transitions. [2018-09-26 08:11:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:11:59,840 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 230 [2018-09-26 08:11:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:59,840 INFO L225 Difference]: With dead ends: 387 [2018-09-26 08:11:59,841 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:11:59,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=12009, Invalid=40661, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:11:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:11:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-09-26 08:11:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:11:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2018-09-26 08:11:59,867 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 230 [2018-09-26 08:11:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:59,868 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2018-09-26 08:11:59,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:11:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2018-09-26 08:11:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:11:59,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:59,869 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 1, 1, 1, 1] [2018-09-26 08:11:59,869 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:59,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash -917464525, now seen corresponding path program 150 times [2018-09-26 08:11:59,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 2926 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:00,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:00,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:12:00,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:12:00,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:12:00,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:12:00,244 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 80 states. [2018-09-26 08:12:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:00,510 INFO L93 Difference]: Finished difference Result 240 states and 241 transitions. [2018-09-26 08:12:00,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:12:00,510 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 231 [2018-09-26 08:12:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:00,511 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:12:00,511 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:12:00,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5852 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9243, Invalid=15249, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:12:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:12:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2018-09-26 08:12:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:12:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-09-26 08:12:00,552 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 231 [2018-09-26 08:12:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:00,553 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-09-26 08:12:00,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:12:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-09-26 08:12:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:12:00,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:00,554 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1, 1, 1] [2018-09-26 08:12:00,555 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:00,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1215046821, now seen corresponding path program 151 times [2018-09-26 08:12:00,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 5852 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:01,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:01,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:12:01,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:12:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:12:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6161, Invalid=18019, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:12:01,177 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 156 states. [2018-09-26 08:12:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:02,500 INFO L93 Difference]: Finished difference Result 392 states and 394 transitions. [2018-09-26 08:12:02,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:12:02,501 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 233 [2018-09-26 08:12:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:02,501 INFO L225 Difference]: With dead ends: 392 [2018-09-26 08:12:02,501 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:12:02,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12321, Invalid=41735, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:12:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:12:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:12:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:12:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:12:02,533 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 233 [2018-09-26 08:12:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:02,534 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:12:02,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:12:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:12:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:12:02,534 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:02,534 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 1, 1, 1, 1] [2018-09-26 08:12:02,535 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:02,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1878604798, now seen corresponding path program 152 times [2018-09-26 08:12:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 3003 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:02,896 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:12:02,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:12:02,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:12:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:12:02,897 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 81 states. [2018-09-26 08:12:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:03,200 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-09-26 08:12:03,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:12:03,200 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 234 [2018-09-26 08:12:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:03,201 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:12:03,201 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:12:03,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9480, Invalid=15642, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:12:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:12:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2018-09-26 08:12:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:12:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-09-26 08:12:03,226 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-09-26 08:12:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:03,226 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-09-26 08:12:03,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:12:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-09-26 08:12:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:12:03,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:03,227 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1, 1, 1] [2018-09-26 08:12:03,227 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:03,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:03,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1452880534, now seen corresponding path program 153 times [2018-09-26 08:12:03,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9009 backedges. 6006 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:03,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:03,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:12:03,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:12:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:12:03,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6319, Invalid=18487, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:12:03,843 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 158 states. [2018-09-26 08:12:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:05,208 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2018-09-26 08:12:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:12:05,208 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 236 [2018-09-26 08:12:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:05,208 INFO L225 Difference]: With dead ends: 397 [2018-09-26 08:12:05,208 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:12:05,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8932 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=12637, Invalid=42823, Unknown=0, NotChecked=0, Total=55460 [2018-09-26 08:12:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:12:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-26 08:12:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 08:12:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-09-26 08:12:05,239 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 236 [2018-09-26 08:12:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:05,239 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-09-26 08:12:05,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:12:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-09-26 08:12:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-26 08:12:05,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:05,240 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 1, 1, 1, 1] [2018-09-26 08:12:05,240 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:05,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash 225890147, now seen corresponding path program 154 times [2018-09-26 08:12:05,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3081 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:05,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:05,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:12:05,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:12:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:12:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:12:05,620 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 82 states. [2018-09-26 08:12:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:05,911 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-09-26 08:12:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:12:05,911 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 237 [2018-09-26 08:12:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:05,912 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:12:05,912 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:12:05,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9720, Invalid=16040, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:12:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:12:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2018-09-26 08:12:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-26 08:12:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-09-26 08:12:05,942 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 237 [2018-09-26 08:12:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:05,943 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-09-26 08:12:05,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:12:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-09-26 08:12:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-26 08:12:05,943 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:05,943 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1, 1, 1] [2018-09-26 08:12:05,944 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:05,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1962834805, now seen corresponding path program 155 times [2018-09-26 08:12:05,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9243 backedges. 6162 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:06,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:06,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:12:06,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:12:06,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:12:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6479, Invalid=18961, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:12:06,512 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 160 states. [2018-09-26 08:12:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:07,912 INFO L93 Difference]: Finished difference Result 402 states and 404 transitions. [2018-09-26 08:12:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:12:07,912 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 239 [2018-09-26 08:12:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:07,913 INFO L225 Difference]: With dead ends: 402 [2018-09-26 08:12:07,913 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:12:07,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12957, Invalid=43925, Unknown=0, NotChecked=0, Total=56882 [2018-09-26 08:12:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:12:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:12:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:12:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-09-26 08:12:07,947 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 239 [2018-09-26 08:12:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:07,947 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-09-26 08:12:07,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:12:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-09-26 08:12:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:12:07,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:07,948 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 1, 1, 1, 1] [2018-09-26 08:12:07,948 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:07,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash -304671758, now seen corresponding path program 156 times [2018-09-26 08:12:07,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 3160 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:08,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:08,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:12:08,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:12:08,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:12:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:12:08,331 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 83 states. [2018-09-26 08:12:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:08,654 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-09-26 08:12:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:12:08,654 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 240 [2018-09-26 08:12:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:08,655 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:12:08,655 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:12:08,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9963, Invalid=16443, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:12:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:12:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-09-26 08:12:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:12:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-09-26 08:12:08,699 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-09-26 08:12:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:08,699 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-09-26 08:12:08,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:12:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-09-26 08:12:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:12:08,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:08,701 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1, 1, 1] [2018-09-26 08:12:08,701 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:08,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash -731717286, now seen corresponding path program 157 times [2018-09-26 08:12:08,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 6320 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:09,417 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:09,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:12:09,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:12:09,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:12:09,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6641, Invalid=19441, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:12:09,419 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 162 states. [2018-09-26 08:12:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:10,856 INFO L93 Difference]: Finished difference Result 407 states and 409 transitions. [2018-09-26 08:12:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:12:10,856 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 242 [2018-09-26 08:12:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:10,857 INFO L225 Difference]: With dead ends: 407 [2018-09-26 08:12:10,857 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:12:10,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13281, Invalid=45041, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:12:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:12:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-09-26 08:12:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-09-26 08:12:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 245 transitions. [2018-09-26 08:12:10,904 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 245 transitions. Word has length 242 [2018-09-26 08:12:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:10,904 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 245 transitions. [2018-09-26 08:12:10,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:12:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2018-09-26 08:12:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-26 08:12:10,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:10,906 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 1, 1, 1, 1] [2018-09-26 08:12:10,906 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:10,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1184744595, now seen corresponding path program 158 times [2018-09-26 08:12:10,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 3240 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:11,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:11,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:12:11,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:12:11,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:12:11,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:12:11,357 INFO L87 Difference]: Start difference. First operand 244 states and 245 transitions. Second operand 84 states. [2018-09-26 08:12:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:11,659 INFO L93 Difference]: Finished difference Result 252 states and 253 transitions. [2018-09-26 08:12:11,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:12:11,660 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 243 [2018-09-26 08:12:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:11,660 INFO L225 Difference]: With dead ends: 252 [2018-09-26 08:12:11,660 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 08:12:11,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6480 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10209, Invalid=16851, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:12:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 08:12:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2018-09-26 08:12:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 08:12:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2018-09-26 08:12:11,689 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 243 [2018-09-26 08:12:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,690 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2018-09-26 08:12:11,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:12:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2018-09-26 08:12:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-26 08:12:11,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,690 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1, 1, 1] [2018-09-26 08:12:11,690 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 373288379, now seen corresponding path program 159 times [2018-09-26 08:12:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 6480 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:12,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:12,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:12:12,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:12:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:12:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6805, Invalid=19927, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:12:12,328 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 164 states. [2018-09-26 08:12:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:13,726 INFO L93 Difference]: Finished difference Result 412 states and 414 transitions. [2018-09-26 08:12:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:12:13,726 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 245 [2018-09-26 08:12:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:13,727 INFO L225 Difference]: With dead ends: 412 [2018-09-26 08:12:13,727 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:12:13,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9640 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13609, Invalid=46171, Unknown=0, NotChecked=0, Total=59780 [2018-09-26 08:12:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:12:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-09-26 08:12:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:12:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-09-26 08:12:13,756 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 245 [2018-09-26 08:12:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:13,756 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-09-26 08:12:13,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:12:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-09-26 08:12:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:12:13,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:13,757 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 1, 1, 1, 1] [2018-09-26 08:12:13,757 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:13,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 688919522, now seen corresponding path program 160 times [2018-09-26 08:12:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 3321 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:14,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:14,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:12:14,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:12:14,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:12:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:12:14,172 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 85 states. [2018-09-26 08:12:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:14,465 INFO L93 Difference]: Finished difference Result 255 states and 256 transitions. [2018-09-26 08:12:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:12:14,466 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 246 [2018-09-26 08:12:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:14,466 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:12:14,466 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:12:14,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10458, Invalid=17264, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:12:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:12:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2018-09-26 08:12:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:12:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-09-26 08:12:14,500 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 246 [2018-09-26 08:12:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:14,500 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-09-26 08:12:14,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:12:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-09-26 08:12:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:12:14,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:14,501 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1, 1, 1] [2018-09-26 08:12:14,501 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:14,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash 626763082, now seen corresponding path program 161 times [2018-09-26 08:12:14,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 6642 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:15,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:15,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:12:15,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:12:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:12:15,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6971, Invalid=20419, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:12:15,146 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 166 states. [2018-09-26 08:12:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:16,685 INFO L93 Difference]: Finished difference Result 417 states and 419 transitions. [2018-09-26 08:12:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:12:16,686 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 248 [2018-09-26 08:12:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:16,686 INFO L225 Difference]: With dead ends: 417 [2018-09-26 08:12:16,686 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 08:12:16,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9882 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13941, Invalid=47315, Unknown=0, NotChecked=0, Total=61256 [2018-09-26 08:12:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 08:12:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-09-26 08:12:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-26 08:12:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-09-26 08:12:16,730 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 248 [2018-09-26 08:12:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:16,730 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-09-26 08:12:16,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:12:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-09-26 08:12:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-26 08:12:16,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:16,731 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 1, 1, 1, 1] [2018-09-26 08:12:16,731 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:16,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1910733251, now seen corresponding path program 162 times [2018-09-26 08:12:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 3403 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:17,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:17,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:12:17,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:12:17,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:12:17,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:12:17,126 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 86 states. [2018-09-26 08:12:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:17,479 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2018-09-26 08:12:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:12:17,479 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 249 [2018-09-26 08:12:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:17,480 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:12:17,480 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:12:17,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6806 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10710, Invalid=17682, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:12:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:12:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2018-09-26 08:12:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-26 08:12:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 253 transitions. [2018-09-26 08:12:17,514 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 253 transitions. Word has length 249 [2018-09-26 08:12:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:17,514 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 253 transitions. [2018-09-26 08:12:17,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:12:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 253 transitions. [2018-09-26 08:12:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-26 08:12:17,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:17,515 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1, 1, 1] [2018-09-26 08:12:17,515 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:17,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:17,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2031282453, now seen corresponding path program 163 times [2018-09-26 08:12:17,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 6806 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:18,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:18,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:12:18,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:12:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:12:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7139, Invalid=20917, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:12:18,239 INFO L87 Difference]: Start difference. First operand 252 states and 253 transitions. Second operand 168 states. [2018-09-26 08:12:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:19,823 INFO L93 Difference]: Finished difference Result 422 states and 424 transitions. [2018-09-26 08:12:19,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:12:19,824 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 251 [2018-09-26 08:12:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:19,825 INFO L225 Difference]: With dead ends: 422 [2018-09-26 08:12:19,825 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:12:19,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14277, Invalid=48473, Unknown=0, NotChecked=0, Total=62750 [2018-09-26 08:12:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:12:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-09-26 08:12:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:12:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-09-26 08:12:19,877 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 251 [2018-09-26 08:12:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:19,877 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-09-26 08:12:19,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:12:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-09-26 08:12:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:12:19,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:19,879 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 1, 1, 1, 1] [2018-09-26 08:12:19,879 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:19,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2040251346, now seen corresponding path program 164 times [2018-09-26 08:12:19,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 3486 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:20,481 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:20,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:12:20,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:12:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:12:20,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:12:20,482 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 87 states. [2018-09-26 08:12:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:20,811 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-09-26 08:12:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:12:20,811 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 252 [2018-09-26 08:12:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:20,812 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:12:20,812 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:12:20,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10965, Invalid=18105, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:12:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:12:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-09-26 08:12:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:12:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-09-26 08:12:20,841 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 252 [2018-09-26 08:12:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:20,841 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-09-26 08:12:20,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:12:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-09-26 08:12:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:12:20,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:20,842 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1, 1, 1] [2018-09-26 08:12:20,842 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:20,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2118444742, now seen corresponding path program 165 times [2018-09-26 08:12:20,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 6972 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:21,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:21,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:12:21,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:12:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:12:21,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7309, Invalid=21421, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:12:21,501 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 170 states. [2018-09-26 08:12:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:23,263 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-09-26 08:12:23,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:12:23,263 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 254 [2018-09-26 08:12:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:23,264 INFO L225 Difference]: With dead ends: 427 [2018-09-26 08:12:23,264 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:12:23,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14617, Invalid=49645, Unknown=0, NotChecked=0, Total=64262 [2018-09-26 08:12:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:12:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-09-26 08:12:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-26 08:12:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-09-26 08:12:23,298 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 254 [2018-09-26 08:12:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:23,298 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-09-26 08:12:23,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:12:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-09-26 08:12:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-26 08:12:23,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:23,299 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 1, 1, 1, 1] [2018-09-26 08:12:23,299 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:23,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1226445069, now seen corresponding path program 166 times [2018-09-26 08:12:23,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 3570 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:23,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:23,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:12:23,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:12:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:12:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:12:23,723 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 88 states. [2018-09-26 08:12:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:24,100 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2018-09-26 08:12:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:12:24,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 255 [2018-09-26 08:12:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:24,101 INFO L225 Difference]: With dead ends: 264 [2018-09-26 08:12:24,101 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 08:12:24,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11223, Invalid=18533, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:12:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 08:12:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2018-09-26 08:12:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-09-26 08:12:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2018-09-26 08:12:24,150 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 255 [2018-09-26 08:12:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:24,150 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2018-09-26 08:12:24,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:12:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2018-09-26 08:12:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-26 08:12:24,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:24,152 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1, 1, 1] [2018-09-26 08:12:24,152 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:24,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1792606181, now seen corresponding path program 167 times [2018-09-26 08:12:24,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 7140 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:25,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:25,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:12:25,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:12:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:12:25,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7481, Invalid=21931, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:12:25,041 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 172 states. [2018-09-26 08:12:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:26,161 INFO L93 Difference]: Finished difference Result 432 states and 434 transitions. [2018-09-26 08:12:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:12:26,161 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 257 [2018-09-26 08:12:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:26,162 INFO L225 Difference]: With dead ends: 432 [2018-09-26 08:12:26,162 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:12:26,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10626 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=14961, Invalid=50831, Unknown=0, NotChecked=0, Total=65792 [2018-09-26 08:12:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:12:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:12:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:12:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-09-26 08:12:26,200 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 257 [2018-09-26 08:12:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:26,200 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-09-26 08:12:26,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:12:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-09-26 08:12:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:12:26,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:26,201 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 1, 1, 1, 1] [2018-09-26 08:12:26,201 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:26,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:26,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1193008190, now seen corresponding path program 168 times [2018-09-26 08:12:26,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 3655 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:26,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:26,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:12:26,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:12:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:12:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:12:26,646 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 89 states. [2018-09-26 08:12:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:27,018 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-09-26 08:12:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:12:27,018 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 258 [2018-09-26 08:12:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:27,019 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:12:27,019 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 08:12:27,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11484, Invalid=18966, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:12:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 08:12:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2018-09-26 08:12:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:12:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-09-26 08:12:27,104 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-09-26 08:12:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:27,104 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-09-26 08:12:27,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:12:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-09-26 08:12:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:12:27,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:27,105 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1, 1, 1] [2018-09-26 08:12:27,105 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:27,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash 275463466, now seen corresponding path program 169 times [2018-09-26 08:12:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 7310 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:27,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:27,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:12:27,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:12:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:12:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7655, Invalid=22447, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:12:27,793 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 174 states. [2018-09-26 08:12:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:28,632 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2018-09-26 08:12:28,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:12:28,632 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 260 [2018-09-26 08:12:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:28,633 INFO L225 Difference]: With dead ends: 437 [2018-09-26 08:12:28,633 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 08:12:28,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10880 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15309, Invalid=52031, Unknown=0, NotChecked=0, Total=67340 [2018-09-26 08:12:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 08:12:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2018-09-26 08:12:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-09-26 08:12:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 263 transitions. [2018-09-26 08:12:28,672 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 263 transitions. Word has length 260 [2018-09-26 08:12:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:28,672 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 263 transitions. [2018-09-26 08:12:28,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:12:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 263 transitions. [2018-09-26 08:12:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-26 08:12:28,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:28,673 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 1, 1, 1, 1] [2018-09-26 08:12:28,674 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:28,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash 130229283, now seen corresponding path program 170 times [2018-09-26 08:12:28,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 3741 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:29,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:29,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:12:29,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:12:29,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:12:29,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:12:29,102 INFO L87 Difference]: Start difference. First operand 262 states and 263 transitions. Second operand 90 states. [2018-09-26 08:12:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:29,461 INFO L93 Difference]: Finished difference Result 270 states and 271 transitions. [2018-09-26 08:12:29,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:12:29,462 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 261 [2018-09-26 08:12:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:29,462 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:12:29,462 INFO L226 Difference]: Without dead ends: 268 [2018-09-26 08:12:29,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7482 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11748, Invalid=19404, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:12:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-26 08:12:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2018-09-26 08:12:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-09-26 08:12:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2018-09-26 08:12:29,499 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 261 [2018-09-26 08:12:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:29,499 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2018-09-26 08:12:29,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:12:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2018-09-26 08:12:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-26 08:12:29,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:29,500 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1, 1, 1] [2018-09-26 08:12:29,500 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:29,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash 596355403, now seen corresponding path program 171 times [2018-09-26 08:12:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 7482 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:30,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:30,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:12:30,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:12:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:12:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7831, Invalid=22969, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:12:30,240 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 176 states. [2018-09-26 08:12:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:31,071 INFO L93 Difference]: Finished difference Result 442 states and 444 transitions. [2018-09-26 08:12:31,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:12:31,071 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 263 [2018-09-26 08:12:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:31,071 INFO L225 Difference]: With dead ends: 442 [2018-09-26 08:12:31,071 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 08:12:31,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15661, Invalid=53245, Unknown=0, NotChecked=0, Total=68906 [2018-09-26 08:12:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 08:12:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-09-26 08:12:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:12:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-09-26 08:12:31,103 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 263 [2018-09-26 08:12:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:31,103 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-09-26 08:12:31,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:12:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-09-26 08:12:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:12:31,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:31,105 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 1, 1, 1, 1] [2018-09-26 08:12:31,105 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:31,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1043123278, now seen corresponding path program 172 times [2018-09-26 08:12:31,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 3828 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:31,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:31,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:12:31,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:12:31,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:12:31,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:12:31,536 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 91 states. [2018-09-26 08:12:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:31,885 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2018-09-26 08:12:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:12:31,885 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 264 [2018-09-26 08:12:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:31,885 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:12:31,885 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:12:31,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12015, Invalid=19847, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:12:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:12:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2018-09-26 08:12:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:12:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-09-26 08:12:31,921 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-09-26 08:12:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:31,922 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-09-26 08:12:31,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:12:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-09-26 08:12:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:12:31,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:31,922 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1, 1, 1] [2018-09-26 08:12:31,923 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:31,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:31,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1714024166, now seen corresponding path program 173 times [2018-09-26 08:12:31,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 7656 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:32,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:32,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:12:32,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:12:32,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:12:32,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8009, Invalid=23497, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:12:32,615 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 178 states. [2018-09-26 08:12:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:34,170 INFO L93 Difference]: Finished difference Result 447 states and 449 transitions. [2018-09-26 08:12:34,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:12:34,170 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 266 [2018-09-26 08:12:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:34,170 INFO L225 Difference]: With dead ends: 447 [2018-09-26 08:12:34,170 INFO L226 Difference]: Without dead ends: 268 [2018-09-26 08:12:34,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16017, Invalid=54473, Unknown=0, NotChecked=0, Total=70490 [2018-09-26 08:12:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-26 08:12:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-26 08:12:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-26 08:12:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 269 transitions. [2018-09-26 08:12:34,211 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 269 transitions. Word has length 266 [2018-09-26 08:12:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:34,211 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 269 transitions. [2018-09-26 08:12:34,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:12:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 269 transitions. [2018-09-26 08:12:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-09-26 08:12:34,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:34,212 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 1, 1, 1, 1] [2018-09-26 08:12:34,212 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:34,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1055319725, now seen corresponding path program 174 times [2018-09-26 08:12:34,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 3916 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:34,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:34,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:12:34,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:12:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:12:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:12:34,785 INFO L87 Difference]: Start difference. First operand 268 states and 269 transitions. Second operand 92 states. [2018-09-26 08:12:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:35,180 INFO L93 Difference]: Finished difference Result 276 states and 277 transitions. [2018-09-26 08:12:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:12:35,180 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 267 [2018-09-26 08:12:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:35,181 INFO L225 Difference]: With dead ends: 276 [2018-09-26 08:12:35,181 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 08:12:35,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7832 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12285, Invalid=20295, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:12:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 08:12:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-09-26 08:12:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-26 08:12:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-09-26 08:12:35,218 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 267 [2018-09-26 08:12:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:35,219 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-09-26 08:12:35,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:12:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-09-26 08:12:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-26 08:12:35,219 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:35,219 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1, 1, 1] [2018-09-26 08:12:35,220 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:35,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:35,220 INFO L82 PathProgramCache]: Analyzing trace with hash -549907845, now seen corresponding path program 175 times [2018-09-26 08:12:35,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 7832 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:36,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:36,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:12:36,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:12:36,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:12:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8189, Invalid=24031, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:12:36,160 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 180 states. [2018-09-26 08:12:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:38,320 INFO L93 Difference]: Finished difference Result 452 states and 454 transitions. [2018-09-26 08:12:38,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:12:38,320 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 269 [2018-09-26 08:12:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:38,321 INFO L225 Difference]: With dead ends: 452 [2018-09-26 08:12:38,321 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:12:38,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11660 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=16377, Invalid=55715, Unknown=0, NotChecked=0, Total=72092 [2018-09-26 08:12:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:12:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-09-26 08:12:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:12:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-09-26 08:12:38,362 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 269 [2018-09-26 08:12:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:38,362 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-09-26 08:12:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:12:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-09-26 08:12:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:12:38,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:38,363 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 1, 1, 1, 1] [2018-09-26 08:12:38,363 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:38,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:38,363 INFO L82 PathProgramCache]: Analyzing trace with hash -791481438, now seen corresponding path program 176 times [2018-09-26 08:12:38,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 4005 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:38,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:38,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:12:38,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:12:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:12:38,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:12:38,825 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 93 states. [2018-09-26 08:12:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:39,233 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-09-26 08:12:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:12:39,234 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 270 [2018-09-26 08:12:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:39,234 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:12:39,234 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:12:39,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12558, Invalid=20748, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:12:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:12:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2018-09-26 08:12:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:12:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-09-26 08:12:39,290 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 270 [2018-09-26 08:12:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:39,291 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-09-26 08:12:39,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:12:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-09-26 08:12:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 08:12:39,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:39,292 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1, 1, 1] [2018-09-26 08:12:39,292 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:39,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:39,293 INFO L82 PathProgramCache]: Analyzing trace with hash -404384502, now seen corresponding path program 177 times [2018-09-26 08:12:39,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 8010 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:40,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:40,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:12:40,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:12:40,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:12:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8371, Invalid=24571, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:12:40,257 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 182 states. [2018-09-26 08:12:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:42,653 INFO L93 Difference]: Finished difference Result 457 states and 459 transitions. [2018-09-26 08:12:42,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:12:42,653 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 272 [2018-09-26 08:12:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:42,653 INFO L225 Difference]: With dead ends: 457 [2018-09-26 08:12:42,653 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 08:12:42,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11926 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16741, Invalid=56971, Unknown=0, NotChecked=0, Total=73712 [2018-09-26 08:12:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 08:12:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-09-26 08:12:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-26 08:12:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-09-26 08:12:42,697 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 272 [2018-09-26 08:12:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:42,697 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-09-26 08:12:42,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:12:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-09-26 08:12:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-09-26 08:12:42,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:42,698 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 1, 1, 1, 1] [2018-09-26 08:12:42,698 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:42,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1241894531, now seen corresponding path program 178 times [2018-09-26 08:12:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 4095 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:43,229 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:43,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:12:43,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:12:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:12:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:12:43,231 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 94 states. [2018-09-26 08:12:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:43,649 INFO L93 Difference]: Finished difference Result 282 states and 283 transitions. [2018-09-26 08:12:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:12:43,649 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 273 [2018-09-26 08:12:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:43,650 INFO L225 Difference]: With dead ends: 282 [2018-09-26 08:12:43,650 INFO L226 Difference]: Without dead ends: 280 [2018-09-26 08:12:43,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12834, Invalid=21206, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:12:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-26 08:12:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2018-09-26 08:12:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-26 08:12:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-09-26 08:12:43,689 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 273 [2018-09-26 08:12:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:43,689 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-09-26 08:12:43,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:12:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-09-26 08:12:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-26 08:12:43,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:43,690 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1, 1, 1] [2018-09-26 08:12:43,690 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:43,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash -540197973, now seen corresponding path program 179 times [2018-09-26 08:12:43,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 8190 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:44,583 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:44,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:12:44,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:12:44,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:12:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8555, Invalid=25117, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:12:44,585 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 184 states. [2018-09-26 08:12:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:46,872 INFO L93 Difference]: Finished difference Result 462 states and 464 transitions. [2018-09-26 08:12:46,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:12:46,872 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 275 [2018-09-26 08:12:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:46,873 INFO L225 Difference]: With dead ends: 462 [2018-09-26 08:12:46,873 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:12:46,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12195 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17109, Invalid=58241, Unknown=0, NotChecked=0, Total=75350 [2018-09-26 08:12:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:12:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-26 08:12:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 08:12:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-09-26 08:12:46,909 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 275 [2018-09-26 08:12:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:46,910 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-09-26 08:12:46,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:12:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-09-26 08:12:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 08:12:46,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:46,911 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 90, 1, 1, 1, 1] [2018-09-26 08:12:46,911 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:46,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash -473078894, now seen corresponding path program 180 times [2018-09-26 08:12:46,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 4186 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:47,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:47,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:12:47,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:12:47,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:12:47,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:12:47,434 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 95 states. [2018-09-26 08:12:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:47,895 INFO L93 Difference]: Finished difference Result 285 states and 286 transitions. [2018-09-26 08:12:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:12:47,895 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 276 [2018-09-26 08:12:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:47,896 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:12:47,896 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:12:47,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13113, Invalid=21669, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:12:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:12:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-09-26 08:12:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:12:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-09-26 08:12:47,937 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 276 [2018-09-26 08:12:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:47,937 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-09-26 08:12:47,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:12:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-09-26 08:12:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-26 08:12:47,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:47,938 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1, 1, 1] [2018-09-26 08:12:47,938 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:47,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:47,939 INFO L82 PathProgramCache]: Analyzing trace with hash 637782266, now seen corresponding path program 181 times [2018-09-26 08:12:47,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12558 backedges. 8372 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:48,845 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:48,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:12:48,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:12:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:12:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8741, Invalid=25669, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:12:48,850 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 186 states. [2018-09-26 08:12:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:50,524 INFO L93 Difference]: Finished difference Result 467 states and 469 transitions. [2018-09-26 08:12:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:12:50,525 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 278 [2018-09-26 08:12:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:50,525 INFO L225 Difference]: With dead ends: 467 [2018-09-26 08:12:50,525 INFO L226 Difference]: Without dead ends: 280 [2018-09-26 08:12:50,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12467 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=17481, Invalid=59525, Unknown=0, NotChecked=0, Total=77006 [2018-09-26 08:12:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-26 08:12:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-09-26 08:12:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-09-26 08:12:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-09-26 08:12:50,566 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 278 [2018-09-26 08:12:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:50,566 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-09-26 08:12:50,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:12:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-09-26 08:12:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-09-26 08:12:50,567 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:50,567 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 91, 1, 1, 1, 1] [2018-09-26 08:12:50,567 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:50,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:50,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1272495181, now seen corresponding path program 182 times [2018-09-26 08:12:50,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 4278 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:51,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:51,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:12:51,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:12:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:12:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:12:51,122 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 96 states. [2018-09-26 08:12:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:51,587 INFO L93 Difference]: Finished difference Result 288 states and 289 transitions. [2018-09-26 08:12:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:12:51,587 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 279 [2018-09-26 08:12:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:51,588 INFO L225 Difference]: With dead ends: 288 [2018-09-26 08:12:51,588 INFO L226 Difference]: Without dead ends: 286 [2018-09-26 08:12:51,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8556 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13395, Invalid=22137, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:12:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-26 08:12:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-09-26 08:12:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-09-26 08:12:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 283 transitions. [2018-09-26 08:12:51,629 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 283 transitions. Word has length 279 [2018-09-26 08:12:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:51,629 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 283 transitions. [2018-09-26 08:12:51,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:12:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 283 transitions. [2018-09-26 08:12:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-09-26 08:12:51,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:51,630 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1, 1, 1] [2018-09-26 08:12:51,631 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:51,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1197876443, now seen corresponding path program 183 times [2018-09-26 08:12:51,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12834 backedges. 8556 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:52,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:52,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:12:52,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:12:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:12:52,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8929, Invalid=26227, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:12:52,568 INFO L87 Difference]: Start difference. First operand 282 states and 283 transitions. Second operand 188 states. [2018-09-26 08:12:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:53,634 INFO L93 Difference]: Finished difference Result 472 states and 474 transitions. [2018-09-26 08:12:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:12:53,634 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 281 [2018-09-26 08:12:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:53,635 INFO L225 Difference]: With dead ends: 472 [2018-09-26 08:12:53,635 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:12:53,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=17857, Invalid=60823, Unknown=0, NotChecked=0, Total=78680 [2018-09-26 08:12:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:12:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-09-26 08:12:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:12:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-09-26 08:12:53,680 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 281 [2018-09-26 08:12:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:53,680 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-09-26 08:12:53,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:12:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-09-26 08:12:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:12:53,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:53,681 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 92, 1, 1, 1, 1] [2018-09-26 08:12:53,682 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:53,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash 439124866, now seen corresponding path program 184 times [2018-09-26 08:12:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 4371 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:54,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:54,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:12:54,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:12:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:12:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:12:54,280 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 97 states. [2018-09-26 08:12:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:54,742 INFO L93 Difference]: Finished difference Result 291 states and 292 transitions. [2018-09-26 08:12:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:12:54,742 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 282 [2018-09-26 08:12:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:54,743 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:12:54,743 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:12:54,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13680, Invalid=22610, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:12:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:12:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2018-09-26 08:12:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:12:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-09-26 08:12:54,785 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-09-26 08:12:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:54,785 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-09-26 08:12:54,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:12:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-09-26 08:12:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 08:12:54,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:54,786 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1, 1, 1] [2018-09-26 08:12:54,786 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:54,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1092267242, now seen corresponding path program 185 times [2018-09-26 08:12:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 8742 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:55,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:55,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:12:55,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:12:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:12:55,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:12:55,778 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 190 states. [2018-09-26 08:12:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:58,536 INFO L93 Difference]: Finished difference Result 477 states and 479 transitions. [2018-09-26 08:12:58,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:12:58,536 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 284 [2018-09-26 08:12:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:58,537 INFO L225 Difference]: With dead ends: 477 [2018-09-26 08:12:58,537 INFO L226 Difference]: Without dead ends: 286 [2018-09-26 08:12:58,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13020 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18237, Invalid=62135, Unknown=0, NotChecked=0, Total=80372 [2018-09-26 08:12:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-26 08:12:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-09-26 08:12:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 08:12:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 287 transitions. [2018-09-26 08:12:58,583 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 287 transitions. Word has length 284 [2018-09-26 08:12:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:58,583 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 287 transitions. [2018-09-26 08:12:58,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:12:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 287 transitions. [2018-09-26 08:12:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-26 08:12:58,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:58,584 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 93, 1, 1, 1, 1] [2018-09-26 08:12:58,584 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:58,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:58,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1536915683, now seen corresponding path program 186 times [2018-09-26 08:12:58,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 4465 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:59,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:59,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:12:59,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:12:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:12:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:12:59,280 INFO L87 Difference]: Start difference. First operand 286 states and 287 transitions. Second operand 98 states. [2018-09-26 08:12:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:59,725 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2018-09-26 08:12:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:12:59,725 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 285 [2018-09-26 08:12:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:59,725 INFO L225 Difference]: With dead ends: 294 [2018-09-26 08:12:59,725 INFO L226 Difference]: Without dead ends: 292 [2018-09-26 08:12:59,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8930 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13968, Invalid=23088, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:12:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-09-26 08:12:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2018-09-26 08:12:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-09-26 08:12:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2018-09-26 08:12:59,768 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 285 [2018-09-26 08:12:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:59,768 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2018-09-26 08:12:59,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:12:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2018-09-26 08:12:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-26 08:12:59,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:59,769 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1, 1, 1] [2018-09-26 08:12:59,769 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:59,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash -492712437, now seen corresponding path program 187 times [2018-09-26 08:12:59,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 8930 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:00,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:00,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:13:00,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:13:00,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:13:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9311, Invalid=27361, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:13:00,764 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 192 states. [2018-09-26 08:13:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:02,281 INFO L93 Difference]: Finished difference Result 482 states and 484 transitions. [2018-09-26 08:13:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:13:02,281 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 287 [2018-09-26 08:13:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:02,282 INFO L225 Difference]: With dead ends: 482 [2018-09-26 08:13:02,282 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:13:02,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13301 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18621, Invalid=63461, Unknown=0, NotChecked=0, Total=82082 [2018-09-26 08:13:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:13:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-09-26 08:13:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 08:13:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-09-26 08:13:02,329 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 287 [2018-09-26 08:13:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:02,329 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-09-26 08:13:02,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:13:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-09-26 08:13:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 08:13:02,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:02,330 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 94, 1, 1, 1, 1] [2018-09-26 08:13:02,330 INFO L423 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:02,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash 349852530, now seen corresponding path program 188 times [2018-09-26 08:13:02,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13490 backedges. 4560 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:02,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:02,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:13:02,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:13:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:13:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:13:02,940 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 99 states. [2018-09-26 08:13:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:03,447 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-09-26 08:13:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:13:03,447 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 288 [2018-09-26 08:13:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:03,448 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:13:03,448 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:13:03,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14259, Invalid=23571, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:13:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:13:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2018-09-26 08:13:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:13:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-09-26 08:13:03,493 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 288 [2018-09-26 08:13:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:03,494 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-09-26 08:13:03,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:13:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-09-26 08:13:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:13:03,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:03,495 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1, 1, 1] [2018-09-26 08:13:03,495 INFO L423 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:03,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1200898266, now seen corresponding path program 189 times [2018-09-26 08:13:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13680 backedges. 9120 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:04,561 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:04,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:13:04,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:13:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:13:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9505, Invalid=27937, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:13:04,565 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 194 states. [2018-09-26 08:13:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:07,393 INFO L93 Difference]: Finished difference Result 487 states and 489 transitions. [2018-09-26 08:13:07,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:13:07,393 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 290 [2018-09-26 08:13:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:07,394 INFO L225 Difference]: With dead ends: 487 [2018-09-26 08:13:07,394 INFO L226 Difference]: Without dead ends: 292 [2018-09-26 08:13:07,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13585 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19009, Invalid=64801, Unknown=0, NotChecked=0, Total=83810 [2018-09-26 08:13:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-09-26 08:13:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-09-26 08:13:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-09-26 08:13:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 293 transitions. [2018-09-26 08:13:07,441 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 293 transitions. Word has length 290 [2018-09-26 08:13:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:07,441 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 293 transitions. [2018-09-26 08:13:07,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:13:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 293 transitions. [2018-09-26 08:13:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-26 08:13:07,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:07,442 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 95, 1, 1, 1, 1] [2018-09-26 08:13:07,442 INFO L423 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:07,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:07,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2030014957, now seen corresponding path program 190 times [2018-09-26 08:13:07,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13776 backedges. 4656 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:08,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:08,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:13:08,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:13:08,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:13:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:13:08,084 INFO L87 Difference]: Start difference. First operand 292 states and 293 transitions. Second operand 100 states. [2018-09-26 08:13:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:08,611 INFO L93 Difference]: Finished difference Result 300 states and 301 transitions. [2018-09-26 08:13:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:13:08,611 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 291 [2018-09-26 08:13:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:08,611 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:13:08,612 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 08:13:08,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14553, Invalid=24059, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:13:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 08:13:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2018-09-26 08:13:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-26 08:13:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-09-26 08:13:08,657 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 291 [2018-09-26 08:13:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:08,657 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-09-26 08:13:08,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:13:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-09-26 08:13:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-09-26 08:13:08,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:08,659 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1, 1, 1] [2018-09-26 08:13:08,659 INFO L423 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:08,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash -929155269, now seen corresponding path program 191 times [2018-09-26 08:13:08,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13968 backedges. 9312 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:09,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:09,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:13:09,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:13:09,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:13:09,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9701, Invalid=28519, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:13:09,797 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 196 states. [2018-09-26 08:13:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:12,807 INFO L93 Difference]: Finished difference Result 492 states and 494 transitions. [2018-09-26 08:13:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:13:12,807 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 293 [2018-09-26 08:13:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:12,808 INFO L225 Difference]: With dead ends: 492 [2018-09-26 08:13:12,808 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:13:12,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13872 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19401, Invalid=66155, Unknown=0, NotChecked=0, Total=85556 [2018-09-26 08:13:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:13:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-09-26 08:13:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-09-26 08:13:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-09-26 08:13:12,856 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 293 [2018-09-26 08:13:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:12,856 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-09-26 08:13:12,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:13:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-09-26 08:13:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-26 08:13:12,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:12,858 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 1, 1, 1, 1] [2018-09-26 08:13:12,858 INFO L423 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:12,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1447088994, now seen corresponding path program 192 times [2018-09-26 08:13:12,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14065 backedges. 4753 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:13,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:13,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:13:13,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:13:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:13:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:13:13,521 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 101 states. [2018-09-26 08:13:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:14,053 INFO L93 Difference]: Finished difference Result 303 states and 304 transitions. [2018-09-26 08:13:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:13:14,054 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 294 [2018-09-26 08:13:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:14,054 INFO L225 Difference]: With dead ends: 303 [2018-09-26 08:13:14,054 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 08:13:14,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14850, Invalid=24552, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:13:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 08:13:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-09-26 08:13:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 08:13:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-09-26 08:13:14,105 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 294 [2018-09-26 08:13:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:14,106 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-09-26 08:13:14,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:13:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-09-26 08:13:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 08:13:14,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:14,107 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1, 1, 1] [2018-09-26 08:13:14,107 INFO L423 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:14,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash -916814646, now seen corresponding path program 193 times [2018-09-26 08:13:14,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 9506 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:15,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:15,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:13:15,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:13:15,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:13:15,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9899, Invalid=29107, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:13:15,205 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 198 states. [2018-09-26 08:13:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:18,139 INFO L93 Difference]: Finished difference Result 497 states and 499 transitions. [2018-09-26 08:13:18,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:13:18,140 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 296 [2018-09-26 08:13:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:18,140 INFO L225 Difference]: With dead ends: 497 [2018-09-26 08:13:18,140 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 08:13:18,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19797, Invalid=67523, Unknown=0, NotChecked=0, Total=87320 [2018-09-26 08:13:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 08:13:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-09-26 08:13:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-09-26 08:13:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-09-26 08:13:18,189 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 296 [2018-09-26 08:13:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:18,189 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-09-26 08:13:18,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:13:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-09-26 08:13:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-09-26 08:13:18,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:18,191 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 1, 1, 1, 1] [2018-09-26 08:13:18,191 INFO L423 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:18,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash 125051715, now seen corresponding path program 194 times [2018-09-26 08:13:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14357 backedges. 4851 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:18,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:18,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:13:18,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:13:18,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:13:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:13:18,852 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 102 states. [2018-09-26 08:13:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:19,395 INFO L93 Difference]: Finished difference Result 306 states and 307 transitions. [2018-09-26 08:13:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:13:19,396 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 297 [2018-09-26 08:13:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:19,396 INFO L225 Difference]: With dead ends: 306 [2018-09-26 08:13:19,396 INFO L226 Difference]: Without dead ends: 304 [2018-09-26 08:13:19,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9702 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15150, Invalid=25050, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:13:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-26 08:13:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2018-09-26 08:13:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-09-26 08:13:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2018-09-26 08:13:19,444 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 297 [2018-09-26 08:13:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:19,444 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2018-09-26 08:13:19,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:13:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2018-09-26 08:13:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-09-26 08:13:19,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:19,445 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1, 1, 1] [2018-09-26 08:13:19,445 INFO L423 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:19,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash -84320149, now seen corresponding path program 195 times [2018-09-26 08:13:19,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 9702 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:20,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:20,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:13:20,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:13:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:13:20,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10099, Invalid=29701, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:13:20,546 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand 200 states. [2018-09-26 08:13:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:23,704 INFO L93 Difference]: Finished difference Result 502 states and 504 transitions. [2018-09-26 08:13:23,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:13:23,704 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 299 [2018-09-26 08:13:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:23,704 INFO L225 Difference]: With dead ends: 502 [2018-09-26 08:13:23,705 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 08:13:23,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14455 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20197, Invalid=68905, Unknown=0, NotChecked=0, Total=89102 [2018-09-26 08:13:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 08:13:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 08:13:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:13:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-09-26 08:13:23,766 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 299 [2018-09-26 08:13:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:23,766 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-09-26 08:13:23,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:13:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-09-26 08:13:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:13:23,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:23,767 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 1, 1, 1, 1] [2018-09-26 08:13:23,768 INFO L423 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:23,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1572207790, now seen corresponding path program 196 times [2018-09-26 08:13:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14652 backedges. 4950 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:24,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:24,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:13:24,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:13:24,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:13:24,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:13:24,433 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 103 states. [2018-09-26 08:13:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:24,963 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-09-26 08:13:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:13:24,963 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 300 [2018-09-26 08:13:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:24,964 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:13:24,964 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:13:24,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15453, Invalid=25553, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:13:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:13:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-09-26 08:13:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:13:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-09-26 08:13:25,013 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 300 [2018-09-26 08:13:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:25,013 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-09-26 08:13:25,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:13:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-09-26 08:13:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-26 08:13:25,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:25,015 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1, 1, 1] [2018-09-26 08:13:25,015 INFO L423 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:25,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 936868026, now seen corresponding path program 197 times [2018-09-26 08:13:25,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 9900 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:26,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:26,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:13:26,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:13:26,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:13:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10301, Invalid=30301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:13:26,168 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 202 states. [2018-09-26 08:13:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:29,287 INFO L93 Difference]: Finished difference Result 507 states and 509 transitions. [2018-09-26 08:13:29,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:13:29,288 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 302 [2018-09-26 08:13:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:29,288 INFO L225 Difference]: With dead ends: 507 [2018-09-26 08:13:29,288 INFO L226 Difference]: Without dead ends: 304 [2018-09-26 08:13:29,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14751 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20601, Invalid=70301, Unknown=0, NotChecked=0, Total=90902 [2018-09-26 08:13:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-26 08:13:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2018-09-26 08:13:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-09-26 08:13:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2018-09-26 08:13:29,338 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 302 [2018-09-26 08:13:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:29,339 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2018-09-26 08:13:29,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:13:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2018-09-26 08:13:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-26 08:13:29,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:29,340 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 1, 1, 1, 1] [2018-09-26 08:13:29,340 INFO L423 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:29,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -661350285, now seen corresponding path program 198 times [2018-09-26 08:13:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14950 backedges. 5050 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:30,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:30,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:13:30,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:13:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:13:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:13:30,035 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 104 states. [2018-09-26 08:13:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:30,558 INFO L93 Difference]: Finished difference Result 312 states and 313 transitions. [2018-09-26 08:13:30,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:13:30,558 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 303 [2018-09-26 08:13:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:30,559 INFO L225 Difference]: With dead ends: 312 [2018-09-26 08:13:30,559 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 08:13:30,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15759, Invalid=26061, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:13:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 08:13:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2018-09-26 08:13:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-26 08:13:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2018-09-26 08:13:30,607 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 303 [2018-09-26 08:13:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:30,607 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 307 transitions. [2018-09-26 08:13:30,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:13:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 307 transitions. [2018-09-26 08:13:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-26 08:13:30,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:30,608 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1, 1, 1] [2018-09-26 08:13:30,609 INFO L423 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:30,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:30,609 INFO L82 PathProgramCache]: Analyzing trace with hash 97601947, now seen corresponding path program 199 times [2018-09-26 08:13:30,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 10100 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:31,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:31,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:13:31,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:13:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:13:31,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10505, Invalid=30907, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:13:31,736 INFO L87 Difference]: Start difference. First operand 306 states and 307 transitions. Second operand 204 states. [2018-09-26 08:13:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:34,965 INFO L93 Difference]: Finished difference Result 512 states and 514 transitions. [2018-09-26 08:13:34,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:13:34,965 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 305 [2018-09-26 08:13:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:34,965 INFO L225 Difference]: With dead ends: 512 [2018-09-26 08:13:34,965 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:13:34,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15050 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=21009, Invalid=71711, Unknown=0, NotChecked=0, Total=92720 [2018-09-26 08:13:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:13:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-26 08:13:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:13:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-09-26 08:13:35,016 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 305 [2018-09-26 08:13:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:35,017 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-09-26 08:13:35,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:13:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-09-26 08:13:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:13:35,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:35,018 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 100, 1, 1, 1, 1] [2018-09-26 08:13:35,018 INFO L423 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:35,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:35,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1583342402, now seen corresponding path program 200 times [2018-09-26 08:13:35,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15251 backedges. 5151 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:35,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:35,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:13:35,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:13:35,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:13:35,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5358, Invalid=5562, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:13:35,677 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 105 states. [2018-09-26 08:13:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:36,222 INFO L93 Difference]: Finished difference Result 315 states and 316 transitions. [2018-09-26 08:13:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:13:36,222 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 306 [2018-09-26 08:13:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:36,223 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:13:36,223 INFO L226 Difference]: Without dead ends: 313 [2018-09-26 08:13:36,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16068, Invalid=26574, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:13:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-26 08:13:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-09-26 08:13:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 08:13:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-09-26 08:13:36,272 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 306 [2018-09-26 08:13:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:36,272 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-09-26 08:13:36,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:13:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-09-26 08:13:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 08:13:36,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:36,273 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 101, 1, 1, 1, 1] [2018-09-26 08:13:36,274 INFO L423 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:36,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1173691562, now seen corresponding path program 201 times [2018-09-26 08:13:36,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 10302 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:37,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:37,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:13:37,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:13:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:13:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10711, Invalid=31519, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:13:37,394 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 206 states. [2018-09-26 08:13:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:40,632 INFO L93 Difference]: Finished difference Result 517 states and 519 transitions. [2018-09-26 08:13:40,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:13:40,632 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 308 [2018-09-26 08:13:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:40,633 INFO L225 Difference]: With dead ends: 517 [2018-09-26 08:13:40,633 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 08:13:40,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15352 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21421, Invalid=73135, Unknown=0, NotChecked=0, Total=94556 [2018-09-26 08:13:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 08:13:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-09-26 08:13:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-26 08:13:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 311 transitions. [2018-09-26 08:13:40,685 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 311 transitions. Word has length 308 [2018-09-26 08:13:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:40,686 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 311 transitions. [2018-09-26 08:13:40,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:13:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 311 transitions. [2018-09-26 08:13:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-09-26 08:13:40,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:40,687 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 1, 1, 1, 1] [2018-09-26 08:13:40,687 INFO L423 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:40,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1065366109, now seen corresponding path program 202 times [2018-09-26 08:13:40,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 5253 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:41,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:41,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:13:41,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:13:41,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:13:41,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5462, Invalid=5668, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:13:41,338 INFO L87 Difference]: Start difference. First operand 310 states and 311 transitions. Second operand 106 states. [2018-09-26 08:13:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:41,858 INFO L93 Difference]: Finished difference Result 318 states and 319 transitions. [2018-09-26 08:13:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:13:41,858 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 309 [2018-09-26 08:13:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:41,859 INFO L225 Difference]: With dead ends: 318 [2018-09-26 08:13:41,859 INFO L226 Difference]: Without dead ends: 316 [2018-09-26 08:13:41,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16380, Invalid=27092, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:13:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-09-26 08:13:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2018-09-26 08:13:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-09-26 08:13:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2018-09-26 08:13:41,970 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 309 [2018-09-26 08:13:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:41,970 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2018-09-26 08:13:41,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:13:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2018-09-26 08:13:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-09-26 08:13:41,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:41,971 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 102, 1, 1, 1, 1] [2018-09-26 08:13:41,971 INFO L423 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:41,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1614548277, now seen corresponding path program 203 times [2018-09-26 08:13:41,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 10506 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:43,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:43,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:13:43,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:13:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:13:43,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10919, Invalid=32137, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:13:43,011 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 208 states. [2018-09-26 08:13:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:46,414 INFO L93 Difference]: Finished difference Result 522 states and 524 transitions. [2018-09-26 08:13:46,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:13:46,414 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 311 [2018-09-26 08:13:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:46,415 INFO L225 Difference]: With dead ends: 522 [2018-09-26 08:13:46,415 INFO L226 Difference]: Without dead ends: 313 [2018-09-26 08:13:46,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15657 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21837, Invalid=74573, Unknown=0, NotChecked=0, Total=96410 [2018-09-26 08:13:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-26 08:13:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-09-26 08:13:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 08:13:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-09-26 08:13:46,470 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 311 [2018-09-26 08:13:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:46,470 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-09-26 08:13:46,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:13:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-09-26 08:13:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 08:13:46,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:46,471 INFO L375 BasicCegarLoop]: trace histogram [103, 103, 102, 1, 1, 1, 1] [2018-09-26 08:13:46,471 INFO L423 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:46,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash -244550862, now seen corresponding path program 204 times [2018-09-26 08:13:46,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15862 backedges. 5356 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:47,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:47,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:13:47,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:13:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:13:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5567, Invalid=5775, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:13:47,141 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 107 states. [2018-09-26 08:13:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:47,681 INFO L93 Difference]: Finished difference Result 321 states and 322 transitions. [2018-09-26 08:13:47,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:13:47,681 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 312 [2018-09-26 08:13:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:47,682 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:13:47,682 INFO L226 Difference]: Without dead ends: 319 [2018-09-26 08:13:47,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10712 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16695, Invalid=27615, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:13:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-09-26 08:13:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2018-09-26 08:13:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:13:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-09-26 08:13:47,731 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 312 [2018-09-26 08:13:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:47,731 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-09-26 08:13:47,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:13:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-09-26 08:13:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:13:47,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:47,732 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 103, 1, 1, 1, 1] [2018-09-26 08:13:47,732 INFO L423 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:47,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1209888922, now seen corresponding path program 205 times [2018-09-26 08:13:47,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16068 backedges. 10712 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:48,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:48,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-09-26 08:13:48,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-09-26 08:13:48,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-09-26 08:13:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11129, Invalid=32761, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:13:48,766 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 210 states. [2018-09-26 08:13:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:52,115 INFO L93 Difference]: Finished difference Result 527 states and 529 transitions. [2018-09-26 08:13:52,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:13:52,115 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 314 [2018-09-26 08:13:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:52,116 INFO L225 Difference]: With dead ends: 527 [2018-09-26 08:13:52,116 INFO L226 Difference]: Without dead ends: 316 [2018-09-26 08:13:52,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15965 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22257, Invalid=76025, Unknown=0, NotChecked=0, Total=98282 [2018-09-26 08:13:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-09-26 08:13:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2018-09-26 08:13:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-09-26 08:13:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 317 transitions. [2018-09-26 08:13:52,166 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 317 transitions. Word has length 314 [2018-09-26 08:13:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:52,166 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 317 transitions. [2018-09-26 08:13:52,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-09-26 08:13:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 317 transitions. [2018-09-26 08:13:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-26 08:13:52,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:52,168 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 103, 1, 1, 1, 1] [2018-09-26 08:13:52,168 INFO L423 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:52,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash -271334701, now seen corresponding path program 206 times [2018-09-26 08:13:52,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16172 backedges. 5460 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:52,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:52,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:13:52,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:13:52,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:13:52,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:13:52,888 INFO L87 Difference]: Start difference. First operand 316 states and 317 transitions. Second operand 108 states. [2018-09-26 08:13:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:53,377 INFO L93 Difference]: Finished difference Result 324 states and 325 transitions. [2018-09-26 08:13:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:13:53,377 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 315 [2018-09-26 08:13:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:53,378 INFO L225 Difference]: With dead ends: 324 [2018-09-26 08:13:53,378 INFO L226 Difference]: Without dead ends: 322 [2018-09-26 08:13:53,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10920 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17013, Invalid=28143, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:13:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-09-26 08:13:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2018-09-26 08:13:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-26 08:13:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 319 transitions. [2018-09-26 08:13:53,421 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 319 transitions. Word has length 315 [2018-09-26 08:13:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:53,422 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 319 transitions. [2018-09-26 08:13:53,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:13:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 319 transitions. [2018-09-26 08:13:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-09-26 08:13:53,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:53,423 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 104, 1, 1, 1, 1] [2018-09-26 08:13:53,423 INFO L423 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:53,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1240423419, now seen corresponding path program 207 times [2018-09-26 08:13:53,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 10920 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:54,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:54,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:13:54,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:13:54,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:13:54,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11341, Invalid=33391, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:13:54,571 INFO L87 Difference]: Start difference. First operand 318 states and 319 transitions. Second operand 212 states. [2018-09-26 08:13:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:56,946 INFO L93 Difference]: Finished difference Result 532 states and 534 transitions. [2018-09-26 08:13:56,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:13:56,947 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 317 [2018-09-26 08:13:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:56,947 INFO L225 Difference]: With dead ends: 532 [2018-09-26 08:13:56,947 INFO L226 Difference]: Without dead ends: 319 [2018-09-26 08:13:56,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=22681, Invalid=77491, Unknown=0, NotChecked=0, Total=100172 [2018-09-26 08:13:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-09-26 08:13:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-09-26 08:13:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 08:13:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-09-26 08:13:56,997 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 317 [2018-09-26 08:13:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:56,997 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-09-26 08:13:56,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:13:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-09-26 08:13:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-26 08:13:56,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:56,998 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 104, 1, 1, 1, 1] [2018-09-26 08:13:56,999 INFO L423 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:56,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 601469730, now seen corresponding path program 208 times [2018-09-26 08:13:56,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16485 backedges. 5565 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:57,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:57,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:13:57,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:13:57,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:13:57,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5780, Invalid=5992, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:13:57,719 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 109 states. [2018-09-26 08:13:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:58,251 INFO L93 Difference]: Finished difference Result 327 states and 328 transitions. [2018-09-26 08:13:58,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:13:58,251 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 318 [2018-09-26 08:13:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:58,252 INFO L225 Difference]: With dead ends: 327 [2018-09-26 08:13:58,252 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:13:58,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17334, Invalid=28676, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:13:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:13:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2018-09-26 08:13:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-09-26 08:13:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-09-26 08:13:58,303 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 318 [2018-09-26 08:13:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:58,303 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-09-26 08:13:58,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:13:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-09-26 08:13:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-26 08:13:58,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:58,305 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 105, 1, 1, 1, 1] [2018-09-26 08:13:58,305 INFO L423 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:58,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1808108406, now seen corresponding path program 209 times [2018-09-26 08:13:58,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16695 backedges. 11130 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:59,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:59,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-09-26 08:13:59,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-09-26 08:13:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-09-26 08:13:59,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11555, Invalid=34027, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:13:59,403 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 214 states. [2018-09-26 08:14:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:01,690 INFO L93 Difference]: Finished difference Result 537 states and 539 transitions. [2018-09-26 08:14:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:14:01,690 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 320 [2018-09-26 08:14:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:01,691 INFO L225 Difference]: With dead ends: 537 [2018-09-26 08:14:01,691 INFO L226 Difference]: Without dead ends: 322 [2018-09-26 08:14:01,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16590 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23109, Invalid=78971, Unknown=0, NotChecked=0, Total=102080 [2018-09-26 08:14:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-09-26 08:14:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-09-26 08:14:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-09-26 08:14:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 323 transitions. [2018-09-26 08:14:01,744 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 323 transitions. Word has length 320 [2018-09-26 08:14:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:01,744 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 323 transitions. [2018-09-26 08:14:01,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-09-26 08:14:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 323 transitions. [2018-09-26 08:14:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-26 08:14:01,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:01,745 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 105, 1, 1, 1, 1] [2018-09-26 08:14:01,745 INFO L423 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:01,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1582401533, now seen corresponding path program 210 times [2018-09-26 08:14:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16801 backedges. 5671 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:02,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:02,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:14:02,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:14:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:14:02,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:14:02,477 INFO L87 Difference]: Start difference. First operand 322 states and 323 transitions. Second operand 110 states. [2018-09-26 08:14:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:02,997 INFO L93 Difference]: Finished difference Result 330 states and 331 transitions. [2018-09-26 08:14:02,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:14:02,997 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 321 [2018-09-26 08:14:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:02,998 INFO L225 Difference]: With dead ends: 330 [2018-09-26 08:14:02,998 INFO L226 Difference]: Without dead ends: 328 [2018-09-26 08:14:03,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17658, Invalid=29214, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:14:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-09-26 08:14:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-09-26 08:14:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-09-26 08:14:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-09-26 08:14:03,047 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 321 [2018-09-26 08:14:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:03,048 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-09-26 08:14:03,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:14:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-09-26 08:14:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-09-26 08:14:03,049 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:03,049 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 106, 1, 1, 1, 1] [2018-09-26 08:14:03,049 INFO L423 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:03,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash -269384405, now seen corresponding path program 211 times [2018-09-26 08:14:03,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17013 backedges. 11342 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:04,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:04,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:14:04,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:14:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:14:04,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11771, Invalid=34669, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:14:04,196 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 216 states. [2018-09-26 08:14:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:06,560 INFO L93 Difference]: Finished difference Result 542 states and 544 transitions. [2018-09-26 08:14:06,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:14:06,560 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 323 [2018-09-26 08:14:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:06,561 INFO L225 Difference]: With dead ends: 542 [2018-09-26 08:14:06,561 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:14:06,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16907 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23541, Invalid=80465, Unknown=0, NotChecked=0, Total=104006 [2018-09-26 08:14:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:14:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-09-26 08:14:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-26 08:14:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-09-26 08:14:06,613 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 323 [2018-09-26 08:14:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:06,613 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-09-26 08:14:06,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:14:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-09-26 08:14:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-09-26 08:14:06,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:06,614 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 106, 1, 1, 1, 1] [2018-09-26 08:14:06,614 INFO L423 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2140250898, now seen corresponding path program 212 times [2018-09-26 08:14:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 17120 backedges. 5778 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:07,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:07,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:14:07,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:14:07,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:14:07,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5997, Invalid=6213, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:14:07,350 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 111 states. [2018-09-26 08:14:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:07,929 INFO L93 Difference]: Finished difference Result 333 states and 334 transitions. [2018-09-26 08:14:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:14:07,929 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 324 [2018-09-26 08:14:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:07,930 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:14:07,930 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:14:07,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11556 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17985, Invalid=29757, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:14:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:14:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-09-26 08:14:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-09-26 08:14:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-09-26 08:14:07,984 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 324 [2018-09-26 08:14:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:07,985 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-09-26 08:14:07,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:14:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-09-26 08:14:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-26 08:14:07,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:07,986 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 107, 1, 1, 1, 1] [2018-09-26 08:14:07,986 INFO L423 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:07,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:07,986 INFO L82 PathProgramCache]: Analyzing trace with hash -508155782, now seen corresponding path program 213 times [2018-09-26 08:14:07,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 17334 backedges. 11556 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:09,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:09,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-09-26 08:14:09,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-09-26 08:14:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-09-26 08:14:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11989, Invalid=35317, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:14:09,156 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 218 states. [2018-09-26 08:14:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:10,438 INFO L93 Difference]: Finished difference Result 547 states and 549 transitions. [2018-09-26 08:14:10,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:14:10,438 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 326 [2018-09-26 08:14:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:10,439 INFO L225 Difference]: With dead ends: 547 [2018-09-26 08:14:10,439 INFO L226 Difference]: Without dead ends: 328 [2018-09-26 08:14:10,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23977, Invalid=81973, Unknown=0, NotChecked=0, Total=105950 [2018-09-26 08:14:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-09-26 08:14:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-09-26 08:14:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-09-26 08:14:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2018-09-26 08:14:10,485 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 326 [2018-09-26 08:14:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:10,486 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2018-09-26 08:14:10,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-09-26 08:14:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2018-09-26 08:14:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-09-26 08:14:10,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:10,487 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 107, 1, 1, 1, 1] [2018-09-26 08:14:10,487 INFO L423 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:10,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1146229453, now seen corresponding path program 214 times [2018-09-26 08:14:10,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 5886 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:11,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:11,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:14:11,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:14:11,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:14:11,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6107, Invalid=6325, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:14:11,135 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 112 states. [2018-09-26 08:14:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:11,665 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-09-26 08:14:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-09-26 08:14:11,665 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 327 [2018-09-26 08:14:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:11,666 INFO L225 Difference]: With dead ends: 336 [2018-09-26 08:14:11,666 INFO L226 Difference]: Without dead ends: 334 [2018-09-26 08:14:11,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11772 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18315, Invalid=30305, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:14:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-09-26 08:14:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 330. [2018-09-26 08:14:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-26 08:14:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-09-26 08:14:11,712 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 327 [2018-09-26 08:14:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:11,712 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-09-26 08:14:11,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:14:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-09-26 08:14:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-09-26 08:14:11,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:11,713 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 108, 1, 1, 1, 1] [2018-09-26 08:14:11,713 INFO L423 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:11,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:11,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2014810533, now seen corresponding path program 215 times [2018-09-26 08:14:11,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17658 backedges. 11772 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:12,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:12,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-09-26 08:14:12,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-09-26 08:14:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-09-26 08:14:12,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12209, Invalid=35971, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:14:12,856 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 220 states. [2018-09-26 08:14:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:15,157 INFO L93 Difference]: Finished difference Result 552 states and 554 transitions. [2018-09-26 08:14:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-09-26 08:14:15,157 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 329 [2018-09-26 08:14:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:15,158 INFO L225 Difference]: With dead ends: 552 [2018-09-26 08:14:15,158 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:14:15,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17550 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=24417, Invalid=83495, Unknown=0, NotChecked=0, Total=107912 [2018-09-26 08:14:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:14:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-09-26 08:14:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:14:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-09-26 08:14:15,215 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 329 [2018-09-26 08:14:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:15,215 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-09-26 08:14:15,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-09-26 08:14:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-09-26 08:14:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:14:15,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:15,216 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 108, 1, 1, 1, 1] [2018-09-26 08:14:15,216 INFO L423 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1342291198, now seen corresponding path program 216 times [2018-09-26 08:14:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17767 backedges. 5995 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:15,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:15,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:14:15,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:14:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:14:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6218, Invalid=6438, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:14:15,995 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 113 states. [2018-09-26 08:14:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:16,537 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-09-26 08:14:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-09-26 08:14:16,537 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 330 [2018-09-26 08:14:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:16,538 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:14:16,538 INFO L226 Difference]: Without dead ends: 337 [2018-09-26 08:14:16,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11990 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18648, Invalid=30858, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:14:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-09-26 08:14:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2018-09-26 08:14:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-09-26 08:14:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-09-26 08:14:16,592 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 330 [2018-09-26 08:14:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:16,592 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-09-26 08:14:16,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:14:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-09-26 08:14:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-26 08:14:16,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:16,593 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 109, 1, 1, 1, 1] [2018-09-26 08:14:16,594 INFO L423 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:16,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1451586454, now seen corresponding path program 217 times [2018-09-26 08:14:16,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17985 backedges. 11990 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:17,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:17,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-09-26 08:14:17,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-09-26 08:14:17,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-09-26 08:14:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12431, Invalid=36631, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:14:17,804 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 222 states. [2018-09-26 08:14:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:19,618 INFO L93 Difference]: Finished difference Result 557 states and 559 transitions. [2018-09-26 08:14:19,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-09-26 08:14:19,618 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 332 [2018-09-26 08:14:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:19,619 INFO L225 Difference]: With dead ends: 557 [2018-09-26 08:14:19,619 INFO L226 Difference]: Without dead ends: 334 [2018-09-26 08:14:19,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17876 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=24861, Invalid=85031, Unknown=0, NotChecked=0, Total=109892 [2018-09-26 08:14:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-09-26 08:14:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-09-26 08:14:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-26 08:14:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-09-26 08:14:19,672 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 332 [2018-09-26 08:14:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:19,672 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-09-26 08:14:19,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-09-26 08:14:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-09-26 08:14:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-09-26 08:14:19,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:19,673 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 109, 1, 1, 1, 1] [2018-09-26 08:14:19,673 INFO L423 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:19,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1844453987, now seen corresponding path program 218 times [2018-09-26 08:14:19,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 6105 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:20,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:20,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:14:20,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:14:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:14:20,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:14:20,479 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 114 states. [2018-09-26 08:14:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:21,067 INFO L93 Difference]: Finished difference Result 342 states and 343 transitions. [2018-09-26 08:14:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-09-26 08:14:21,068 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 333 [2018-09-26 08:14:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:21,068 INFO L225 Difference]: With dead ends: 342 [2018-09-26 08:14:21,068 INFO L226 Difference]: Without dead ends: 340 [2018-09-26 08:14:21,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18984, Invalid=31416, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:14:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-26 08:14:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2018-09-26 08:14:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-09-26 08:14:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2018-09-26 08:14:21,120 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 333 [2018-09-26 08:14:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:21,120 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2018-09-26 08:14:21,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:14:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2018-09-26 08:14:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-09-26 08:14:21,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:21,121 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 110, 1, 1, 1, 1] [2018-09-26 08:14:21,122 INFO L423 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:21,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:21,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1301145717, now seen corresponding path program 219 times [2018-09-26 08:14:21,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18315 backedges. 12210 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:22,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:22,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-09-26 08:14:22,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-09-26 08:14:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-09-26 08:14:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12655, Invalid=37297, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:14:22,339 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 224 states. [2018-09-26 08:14:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:25,151 INFO L93 Difference]: Finished difference Result 562 states and 564 transitions. [2018-09-26 08:14:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-09-26 08:14:25,151 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 335 [2018-09-26 08:14:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:25,152 INFO L225 Difference]: With dead ends: 562 [2018-09-26 08:14:25,152 INFO L226 Difference]: Without dead ends: 337 [2018-09-26 08:14:25,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=25309, Invalid=86581, Unknown=0, NotChecked=0, Total=111890 [2018-09-26 08:14:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-09-26 08:14:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-09-26 08:14:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 08:14:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-09-26 08:14:25,214 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 335 [2018-09-26 08:14:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:25,214 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-09-26 08:14:25,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-09-26 08:14:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-09-26 08:14:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-09-26 08:14:25,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:25,215 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 110, 1, 1, 1, 1] [2018-09-26 08:14:25,216 INFO L423 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:25,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -502689038, now seen corresponding path program 220 times [2018-09-26 08:14:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18426 backedges. 6216 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:26,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:26,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:14:26,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:14:26,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:14:26,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6443, Invalid=6667, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:14:26,007 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 115 states. [2018-09-26 08:14:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:26,565 INFO L93 Difference]: Finished difference Result 345 states and 346 transitions. [2018-09-26 08:14:26,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-09-26 08:14:26,565 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 336 [2018-09-26 08:14:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:26,566 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:14:26,566 INFO L226 Difference]: Without dead ends: 343 [2018-09-26 08:14:26,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19323, Invalid=31979, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:14:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-26 08:14:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2018-09-26 08:14:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:14:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-09-26 08:14:26,623 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 336 [2018-09-26 08:14:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:26,623 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-09-26 08:14:26,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:14:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-09-26 08:14:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-26 08:14:26,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:26,625 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 111, 1, 1, 1, 1] [2018-09-26 08:14:26,625 INFO L423 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:26,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2047762342, now seen corresponding path program 221 times [2018-09-26 08:14:26,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18648 backedges. 12432 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:27,881 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:27,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-09-26 08:14:27,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-09-26 08:14:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-09-26 08:14:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12881, Invalid=37969, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:14:27,886 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 226 states. [2018-09-26 08:14:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:30,431 INFO L93 Difference]: Finished difference Result 567 states and 569 transitions. [2018-09-26 08:14:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-09-26 08:14:30,432 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 338 [2018-09-26 08:14:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:30,432 INFO L225 Difference]: With dead ends: 567 [2018-09-26 08:14:30,432 INFO L226 Difference]: Without dead ends: 340 [2018-09-26 08:14:30,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18537 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=25761, Invalid=88145, Unknown=0, NotChecked=0, Total=113906 [2018-09-26 08:14:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-26 08:14:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-09-26 08:14:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-26 08:14:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 341 transitions. [2018-09-26 08:14:30,484 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 341 transitions. Word has length 338 [2018-09-26 08:14:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:30,485 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 341 transitions. [2018-09-26 08:14:30,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-09-26 08:14:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 341 transitions. [2018-09-26 08:14:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-09-26 08:14:30,486 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:30,486 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 111, 1, 1, 1, 1] [2018-09-26 08:14:30,486 INFO L423 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:30,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash -753723501, now seen corresponding path program 222 times [2018-09-26 08:14:30,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18760 backedges. 6328 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:31,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:31,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:14:31,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:14:31,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:14:31,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:14:31,267 INFO L87 Difference]: Start difference. First operand 340 states and 341 transitions. Second operand 116 states. [2018-09-26 08:14:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:31,834 INFO L93 Difference]: Finished difference Result 348 states and 349 transitions. [2018-09-26 08:14:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-09-26 08:14:31,834 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 339 [2018-09-26 08:14:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:31,835 INFO L225 Difference]: With dead ends: 348 [2018-09-26 08:14:31,835 INFO L226 Difference]: Without dead ends: 346 [2018-09-26 08:14:31,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12656 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19665, Invalid=32547, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:14:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-09-26 08:14:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2018-09-26 08:14:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-09-26 08:14:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 343 transitions. [2018-09-26 08:14:31,885 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 343 transitions. Word has length 339 [2018-09-26 08:14:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:31,885 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 343 transitions. [2018-09-26 08:14:31,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:14:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 343 transitions. [2018-09-26 08:14:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-09-26 08:14:31,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:31,887 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 112, 1, 1, 1, 1] [2018-09-26 08:14:31,887 INFO L423 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:31,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:31,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1521254587, now seen corresponding path program 223 times [2018-09-26 08:14:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18984 backedges. 12656 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:33,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:33,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-09-26 08:14:33,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-09-26 08:14:33,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-09-26 08:14:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13109, Invalid=38647, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:14:33,094 INFO L87 Difference]: Start difference. First operand 342 states and 343 transitions. Second operand 228 states. [2018-09-26 08:14:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:35,636 INFO L93 Difference]: Finished difference Result 572 states and 574 transitions. [2018-09-26 08:14:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-09-26 08:14:35,637 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 341 [2018-09-26 08:14:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:35,637 INFO L225 Difference]: With dead ends: 572 [2018-09-26 08:14:35,637 INFO L226 Difference]: Without dead ends: 343 [2018-09-26 08:14:35,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18872 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=26217, Invalid=89723, Unknown=0, NotChecked=0, Total=115940 [2018-09-26 08:14:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-26 08:14:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-09-26 08:14:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 08:14:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-09-26 08:14:35,697 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 341 [2018-09-26 08:14:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:35,697 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-09-26 08:14:35,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-09-26 08:14:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-09-26 08:14:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-09-26 08:14:35,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:35,698 INFO L375 BasicCegarLoop]: trace histogram [113, 113, 112, 1, 1, 1, 1] [2018-09-26 08:14:35,698 INFO L423 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:35,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 605917922, now seen corresponding path program 224 times [2018-09-26 08:14:35,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19097 backedges. 6441 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:36,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:36,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:14:36,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:14:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:14:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6672, Invalid=6900, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:14:36,519 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 117 states. [2018-09-26 08:14:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:37,176 INFO L93 Difference]: Finished difference Result 351 states and 352 transitions. [2018-09-26 08:14:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-09-26 08:14:37,176 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 342 [2018-09-26 08:14:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:37,177 INFO L225 Difference]: With dead ends: 351 [2018-09-26 08:14:37,177 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 08:14:37,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20010, Invalid=33120, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:14:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 08:14:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-09-26 08:14:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 08:14:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-09-26 08:14:37,238 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 342 [2018-09-26 08:14:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:37,238 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-09-26 08:14:37,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:14:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-09-26 08:14:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-26 08:14:37,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:37,239 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 113, 1, 1, 1, 1] [2018-09-26 08:14:37,239 INFO L423 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:37,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1828363190, now seen corresponding path program 225 times [2018-09-26 08:14:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19323 backedges. 12882 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:38,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:38,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [229] total 229 [2018-09-26 08:14:38,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-09-26 08:14:38,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-09-26 08:14:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13339, Invalid=39331, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:14:38,626 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 230 states. Received shutdown request... [2018-09-26 08:14:39,630 WARN L832 $PredicateComparison]: unable to prove that (and (<= c_ULTIMATE.start_main_~i~5 113) (<= c_ULTIMATE.start_main_~j~5 48)) is different from false [2018-09-26 08:14:39,637 WARN L854 $PredicateComparison]: unable to prove that (and (<= c_ULTIMATE.start_main_~i~5 113) (<= c_ULTIMATE.start_main_~j~5 48)) is different from true [2018-09-26 08:14:39,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:14:39,639 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:14:39,646 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:14:39,646 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:14:39 BoogieIcfgContainer [2018-09-26 08:14:39,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:14:39,647 INFO L168 Benchmark]: Toolchain (without parser) took 248422.56 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 2.4 GB in the end (delta: -954.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 08:14:39,650 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:14:39,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.57 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:14:39,651 INFO L168 Benchmark]: Boogie Preprocessor took 22.96 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:14:39,651 INFO L168 Benchmark]: RCFGBuilder took 254.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 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:14:39,651 INFO L168 Benchmark]: TraceAbstraction took 248093.86 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.4 GB in the beginning and 2.4 GB in the end (delta: -964.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:14:39,655 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.21 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 43.57 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.96 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 254.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248093.86 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.4 GB in the beginning and 2.4 GB in the end (delta: -964.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 76). Cancelled while BasicCegarLoop was constructing difference of abstraction (345states) and FLOYD_HOARE automaton (currently 182 states, 230 states before enhancement), while ReachableStatesComputation was computing reachable states (376 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. TIMEOUT Result, 248.0s OverallTime, 227 OverallIterations, 114 TraceHistogramMax, 149.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 794 SDtfs, 3703 SDslu, 8081 SDs, 0 SdLazy, 499347 SolverSat, 23922 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 22.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39393 GetRequests, 6555 SyntacticMatches, 0 SemanticMatches, 32838 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1226956 ImplicationChecksByTransitivity, 98.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 226 MinimizatonAttempts, 452 StatesRemovedByMinimization, 113 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 19.9s SatisfiabilityAnalysisTime, 63.3s InterpolantComputationTime, 39555 NumberOfCodeBlocks, 39555 NumberOfCodeBlocksAsserted, 227 NumberOfCheckSat, 39328 ConstructedInterpolants, 0 QuantifiedInterpolants, 26902168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 227 InterpolantComputations, 2 PerfectInterpolantSequences, 740715/1468548 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/down.i_4.bplTransformedIcfg_BEv2_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-14-39-665.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/down.i_4.bplTransformedIcfg_BEv2_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-14-39-665.csv Completed graceful shutdown