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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 14:57:34,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 14:57:34,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 14:57:34,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 14:57:34,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 14:57:34,134 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 14:57:34,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 14:57:34,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 14:57:34,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 14:57:34,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 14:57:34,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 14:57:34,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 14:57:34,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 14:57:34,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 14:57:34,156 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 14:57:34,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 14:57:34,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 14:57:34,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 14:57:34,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 14:57:34,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 14:57:34,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 14:57:34,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 14:57:34,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 14:57:34,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 14:57:34,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 14:57:34,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 14:57:34,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 14:57:34,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 14:57:34,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 14:57:34,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 14:57:34,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 14:57:34,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 14:57:34,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 14:57:34,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 14:57:34,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 14:57:34,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 14:57:34,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 14:57:34,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 14:57:34,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 14:57:34,206 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 14:57:34,206 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 14:57:34,207 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 14:57:34,207 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 14:57:34,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 14:57:34,208 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 14:57:34,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 14:57:34,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 14:57:34,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 14:57:34,210 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 14:57:34,211 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 14:57:34,212 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 14:57:34,213 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 14:57:34,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 14:57:34,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 14:57:34,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 14:57:34,277 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 14:57:34,278 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 14:57:34,279 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl [2018-10-15 14:57:34,279 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl' [2018-10-15 14:57:34,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 14:57:34,334 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 14:57:34,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 14:57:34,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 14:57:34,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 14:57:34,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... [2018-10-15 14:57:34,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... [2018-10-15 14:57:34,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... [2018-10-15 14:57:34,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... [2018-10-15 14:57:34,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... [2018-10-15 14:57:34,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... [2018-10-15 14:57:34,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... [2018-10-15 14:57:34,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 14:57:34,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 14:57:34,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 14:57:34,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 14:57:34,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 14:57:34,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 14:57:34,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 14:57:34,773 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 14:57:34,774 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:34 BoogieIcfgContainer [2018-10-15 14:57:34,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 14:57:34,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 14:57:34,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 14:57:34,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 14:57:34,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:34" (1/2) ... [2018-10-15 14:57:34,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e1301d and model type down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:34, skipping insertion in model container [2018-10-15 14:57:34,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:34" (2/2) ... [2018-10-15 14:57:34,783 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bpl [2018-10-15 14:57:34,795 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 14:57:34,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 14:57:34,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 14:57:34,886 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 14:57:34,887 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 14:57:34,888 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 14:57:34,888 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 14:57:34,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 14:57:34,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 14:57:34,889 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 14:57:34,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 14:57:34,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 14:57:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-10-15 14:57:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 14:57:34,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:34,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:34,919 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:34,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:34,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1693465589, now seen corresponding path program 1 times [2018-10-15 14:57:34,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:35,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 14:57:35,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 14:57:35,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 14:57:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 14:57:35,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 14:57:35,263 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-10-15 14:57:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:35,437 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-10-15 14:57:35,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 14:57:35,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 14:57:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:35,450 INFO L225 Difference]: With dead ends: 39 [2018-10-15 14:57:35,450 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 14:57:35,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 14:57:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-15 14:57:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 14:57:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-15 14:57:35,491 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 19 [2018-10-15 14:57:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:35,492 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-15 14:57:35,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 14:57:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-15 14:57:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 14:57:35,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:35,493 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:35,494 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:35,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1958575211, now seen corresponding path program 1 times [2018-10-15 14:57:35,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:35,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 14:57:35,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 14:57:35,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 14:57:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 14:57:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:35,744 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2018-10-15 14:57:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:36,129 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-15 14:57:36,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 14:57:36,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-10-15 14:57:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:36,134 INFO L225 Difference]: With dead ends: 55 [2018-10-15 14:57:36,134 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 14:57:36,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 14:57:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 14:57:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2018-10-15 14:57:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 14:57:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-10-15 14:57:36,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 27 [2018-10-15 14:57:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:36,143 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-10-15 14:57:36,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 14:57:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-10-15 14:57:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 14:57:36,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:36,145 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:36,145 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:36,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1938113580, now seen corresponding path program 1 times [2018-10-15 14:57:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:36,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:36,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 14:57:36,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 14:57:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 14:57:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-15 14:57:36,389 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2018-10-15 14:57:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:36,932 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-15 14:57:36,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 14:57:36,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-10-15 14:57:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:36,935 INFO L225 Difference]: With dead ends: 65 [2018-10-15 14:57:36,935 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 14:57:36,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-15 14:57:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 14:57:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-15 14:57:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-15 14:57:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-10-15 14:57:36,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-10-15 14:57:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:36,945 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-10-15 14:57:36,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 14:57:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-10-15 14:57:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-15 14:57:36,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:36,947 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:36,947 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:36,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1079433910, now seen corresponding path program 2 times [2018-10-15 14:57:36,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:37,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:37,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 14:57:37,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 14:57:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 14:57:37,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 14:57:37,204 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-10-15 14:57:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:37,758 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-10-15 14:57:37,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 14:57:37,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-10-15 14:57:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:37,761 INFO L225 Difference]: With dead ends: 74 [2018-10-15 14:57:37,761 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 14:57:37,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 14:57:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-10-15 14:57:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 14:57:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-15 14:57:37,771 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 47 [2018-10-15 14:57:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:37,771 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-15 14:57:37,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 14:57:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-15 14:57:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 14:57:37,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:37,774 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:37,774 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:37,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:37,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1890775501, now seen corresponding path program 3 times [2018-10-15 14:57:37,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:38,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:38,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 14:57:38,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 14:57:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 14:57:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-15 14:57:38,013 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2018-10-15 14:57:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:38,651 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-15 14:57:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 14:57:38,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-10-15 14:57:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:38,653 INFO L225 Difference]: With dead ends: 97 [2018-10-15 14:57:38,653 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 14:57:38,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-15 14:57:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 14:57:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-15 14:57:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 14:57:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-10-15 14:57:38,663 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 59 [2018-10-15 14:57:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:38,663 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-10-15 14:57:38,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 14:57:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-10-15 14:57:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 14:57:38,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:38,665 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:38,666 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:38,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash -357687127, now seen corresponding path program 4 times [2018-10-15 14:57:38,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:39,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:39,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 14:57:39,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 14:57:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 14:57:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:39,022 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2018-10-15 14:57:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:39,451 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-10-15 14:57:39,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 14:57:39,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-10-15 14:57:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:39,454 INFO L225 Difference]: With dead ends: 94 [2018-10-15 14:57:39,455 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 14:57:39,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 14:57:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 14:57:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-10-15 14:57:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 14:57:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-10-15 14:57:39,463 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 67 [2018-10-15 14:57:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:39,464 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-10-15 14:57:39,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 14:57:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-10-15 14:57:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 14:57:39,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:39,466 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:39,466 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:39,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1313927954, now seen corresponding path program 5 times [2018-10-15 14:57:39,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:39,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:39,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 14:57:39,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 14:57:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 14:57:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-10-15 14:57:39,685 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2018-10-15 14:57:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:40,255 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-10-15 14:57:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 14:57:40,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-10-15 14:57:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:40,257 INFO L225 Difference]: With dead ends: 129 [2018-10-15 14:57:40,258 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 14:57:40,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 14:57:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 14:57:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-15 14:57:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-15 14:57:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-10-15 14:57:40,266 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 79 [2018-10-15 14:57:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:40,266 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-10-15 14:57:40,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 14:57:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-10-15 14:57:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-15 14:57:40,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:40,268 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:40,268 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:40,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1091162488, now seen corresponding path program 6 times [2018-10-15 14:57:40,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:40,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:40,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 14:57:40,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 14:57:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 14:57:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 14:57:40,579 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 18 states. [2018-10-15 14:57:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:41,447 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-10-15 14:57:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 14:57:41,450 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-10-15 14:57:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:41,452 INFO L225 Difference]: With dead ends: 114 [2018-10-15 14:57:41,452 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 14:57:41,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 14:57:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 14:57:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-10-15 14:57:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 14:57:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-10-15 14:57:41,461 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 87 [2018-10-15 14:57:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:41,461 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-10-15 14:57:41,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 14:57:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-10-15 14:57:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 14:57:41,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:41,464 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:41,464 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:41,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1645226609, now seen corresponding path program 7 times [2018-10-15 14:57:41,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 96 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:41,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:41,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 14:57:41,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 14:57:41,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 14:57:41,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-10-15 14:57:41,762 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2018-10-15 14:57:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:42,352 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-10-15 14:57:42,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 14:57:42,353 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-10-15 14:57:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:42,354 INFO L225 Difference]: With dead ends: 161 [2018-10-15 14:57:42,354 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 14:57:42,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:57:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 14:57:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-10-15 14:57:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 14:57:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-10-15 14:57:42,362 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 99 [2018-10-15 14:57:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:42,362 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-10-15 14:57:42,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 14:57:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-10-15 14:57:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 14:57:42,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:42,364 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:42,364 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:42,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 491458279, now seen corresponding path program 8 times [2018-10-15 14:57:42,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 90 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 14:57:42,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 14:57:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 14:57:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 14:57:42,610 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 21 states. [2018-10-15 14:57:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:43,300 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2018-10-15 14:57:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 14:57:43,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2018-10-15 14:57:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:43,302 INFO L225 Difference]: With dead ends: 134 [2018-10-15 14:57:43,302 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 14:57:43,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=504, Invalid=1946, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 14:57:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 14:57:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-10-15 14:57:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 14:57:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-10-15 14:57:43,311 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 107 [2018-10-15 14:57:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:43,312 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-10-15 14:57:43,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 14:57:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-10-15 14:57:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 14:57:43,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:43,314 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:43,314 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:43,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 179598416, now seen corresponding path program 9 times [2018-10-15 14:57:43,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 150 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:43,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:43,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 14:57:43,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 14:57:43,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 14:57:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-10-15 14:57:43,628 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 25 states. [2018-10-15 14:57:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:44,265 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-10-15 14:57:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 14:57:44,265 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 119 [2018-10-15 14:57:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:44,267 INFO L225 Difference]: With dead ends: 193 [2018-10-15 14:57:44,267 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 14:57:44,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=492, Invalid=2160, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 14:57:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 14:57:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-10-15 14:57:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 14:57:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-10-15 14:57:44,274 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 119 [2018-10-15 14:57:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:44,274 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-10-15 14:57:44,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 14:57:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-10-15 14:57:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 14:57:44,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:44,276 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:44,276 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:44,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash -300514874, now seen corresponding path program 10 times [2018-10-15 14:57:44,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 132 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:44,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:44,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 14:57:44,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 14:57:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 14:57:44,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 14:57:44,821 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 24 states. [2018-10-15 14:57:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:45,627 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2018-10-15 14:57:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 14:57:45,627 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2018-10-15 14:57:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:45,629 INFO L225 Difference]: With dead ends: 154 [2018-10-15 14:57:45,629 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 14:57:45,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=687, Invalid=2735, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:57:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 14:57:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2018-10-15 14:57:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 14:57:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 14:57:45,636 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 127 [2018-10-15 14:57:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:45,637 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 14:57:45,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 14:57:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 14:57:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 14:57:45,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:45,639 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:45,639 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:45,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash 537366703, now seen corresponding path program 11 times [2018-10-15 14:57:45,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 216 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:46,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:46,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 14:57:46,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 14:57:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 14:57:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-10-15 14:57:46,007 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 29 states. [2018-10-15 14:57:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:47,093 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-10-15 14:57:47,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 14:57:47,093 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 139 [2018-10-15 14:57:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:47,094 INFO L225 Difference]: With dead ends: 225 [2018-10-15 14:57:47,094 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 14:57:47,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=659, Invalid=3001, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 14:57:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 14:57:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-15 14:57:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-15 14:57:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-10-15 14:57:47,100 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 139 [2018-10-15 14:57:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:47,101 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-10-15 14:57:47,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 14:57:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-10-15 14:57:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-15 14:57:47,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:47,102 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:47,103 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:47,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash 291653413, now seen corresponding path program 12 times [2018-10-15 14:57:47,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 182 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:48,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:48,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 14:57:48,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 14:57:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 14:57:48,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:48,121 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 27 states. [2018-10-15 14:57:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:49,066 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-10-15 14:57:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 14:57:49,067 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 147 [2018-10-15 14:57:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:49,068 INFO L225 Difference]: With dead ends: 174 [2018-10-15 14:57:49,069 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 14:57:49,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 14:57:49,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 14:57:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2018-10-15 14:57:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 14:57:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-10-15 14:57:49,075 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 147 [2018-10-15 14:57:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:49,075 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-10-15 14:57:49,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 14:57:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-10-15 14:57:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 14:57:49,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:49,077 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:49,077 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:49,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 24330126, now seen corresponding path program 13 times [2018-10-15 14:57:49,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 294 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:49,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:49,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 14:57:49,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 14:57:49,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 14:57:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 14:57:49,461 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 33 states. [2018-10-15 14:57:50,012 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 14:57:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:50,722 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-10-15 14:57:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 14:57:50,722 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 159 [2018-10-15 14:57:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:50,724 INFO L225 Difference]: With dead ends: 257 [2018-10-15 14:57:50,724 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 14:57:50,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=850, Invalid=3980, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 14:57:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 14:57:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-15 14:57:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 14:57:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-10-15 14:57:50,730 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 159 [2018-10-15 14:57:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:50,730 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-10-15 14:57:50,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 14:57:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-10-15 14:57:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-15 14:57:50,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:50,732 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:50,732 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:50,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1322786564, now seen corresponding path program 14 times [2018-10-15 14:57:50,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 240 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:51,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:51,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 14:57:51,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 14:57:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 14:57:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 14:57:51,536 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 30 states. [2018-10-15 14:57:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:52,625 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2018-10-15 14:57:52,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 14:57:52,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 167 [2018-10-15 14:57:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:52,628 INFO L225 Difference]: With dead ends: 194 [2018-10-15 14:57:52,628 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 14:57:52,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 14:57:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 14:57:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2018-10-15 14:57:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 14:57:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-15 14:57:52,634 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 167 [2018-10-15 14:57:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:52,635 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-15 14:57:52,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 14:57:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-15 14:57:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 14:57:52,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:52,636 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:52,637 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:52,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2046738195, now seen corresponding path program 15 times [2018-10-15 14:57:52,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 384 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:53,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:53,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 14:57:53,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 14:57:53,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 14:57:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 14:57:53,217 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 37 states. [2018-10-15 14:57:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:54,361 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-10-15 14:57:54,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 14:57:54,361 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 179 [2018-10-15 14:57:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:54,363 INFO L225 Difference]: With dead ends: 289 [2018-10-15 14:57:54,364 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 14:57:54,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:57:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 14:57:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-10-15 14:57:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 14:57:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-10-15 14:57:54,370 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 179 [2018-10-15 14:57:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:54,370 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-10-15 14:57:54,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 14:57:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-10-15 14:57:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 14:57:54,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:54,371 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:54,372 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:54,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1170327907, now seen corresponding path program 16 times [2018-10-15 14:57:54,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 306 proven. 384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:55,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:55,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 14:57:55,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 14:57:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 14:57:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 14:57:55,191 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 33 states. [2018-10-15 14:57:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:56,722 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2018-10-15 14:57:56,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 14:57:56,723 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 187 [2018-10-15 14:57:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:56,724 INFO L225 Difference]: With dead ends: 214 [2018-10-15 14:57:56,724 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 14:57:56,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 14:57:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 14:57:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2018-10-15 14:57:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 14:57:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-10-15 14:57:56,731 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 187 [2018-10-15 14:57:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:56,732 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-10-15 14:57:56,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 14:57:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-10-15 14:57:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 14:57:56,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:56,733 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:56,733 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:56,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash -329558836, now seen corresponding path program 17 times [2018-10-15 14:57:56,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 486 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:57,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:57,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 14:57:57,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 14:57:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 14:57:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 14:57:57,589 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 41 states. [2018-10-15 14:57:59,778 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 14:58:00,547 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 14:58:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:00,939 INFO L93 Difference]: Finished difference Result 321 states and 322 transitions. [2018-10-15 14:58:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 14:58:00,939 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 199 [2018-10-15 14:58:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:00,941 INFO L225 Difference]: With dead ends: 321 [2018-10-15 14:58:00,941 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 14:58:00,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1304, Invalid=6352, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 14:58:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 14:58:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-10-15 14:58:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-15 14:58:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-10-15 14:58:00,947 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 199 [2018-10-15 14:58:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:00,947 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-10-15 14:58:00,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 14:58:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-10-15 14:58:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-15 14:58:00,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:00,949 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:00,949 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:00,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1560872514, now seen corresponding path program 18 times [2018-10-15 14:58:00,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 380 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:01,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:01,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 14:58:01,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 14:58:01,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 14:58:01,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 14:58:01,843 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 36 states. [2018-10-15 14:58:02,816 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-10-15 14:58:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:03,827 INFO L93 Difference]: Finished difference Result 234 states and 235 transitions. [2018-10-15 14:58:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 14:58:03,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2018-10-15 14:58:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:03,830 INFO L225 Difference]: With dead ends: 234 [2018-10-15 14:58:03,830 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 14:58:03,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 14:58:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 14:58:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 220. [2018-10-15 14:58:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 14:58:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-10-15 14:58:03,835 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 207 [2018-10-15 14:58:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:03,836 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-10-15 14:58:03,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 14:58:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-10-15 14:58:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 14:58:03,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:03,837 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:03,838 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:03,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:03,838 INFO L82 PathProgramCache]: Analyzing trace with hash -892650709, now seen corresponding path program 19 times [2018-10-15 14:58:03,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 600 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:05,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:05,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 14:58:05,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 14:58:05,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 14:58:05,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 14:58:05,408 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 45 states. [2018-10-15 14:58:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:07,398 INFO L93 Difference]: Finished difference Result 353 states and 354 transitions. [2018-10-15 14:58:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 14:58:07,400 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 219 [2018-10-15 14:58:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:07,401 INFO L225 Difference]: With dead ends: 353 [2018-10-15 14:58:07,401 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 14:58:07,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1567, Invalid=7745, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 14:58:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 14:58:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-15 14:58:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-15 14:58:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 229 transitions. [2018-10-15 14:58:07,407 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 229 transitions. Word has length 219 [2018-10-15 14:58:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:07,407 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 229 transitions. [2018-10-15 14:58:07,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 14:58:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 229 transitions. [2018-10-15 14:58:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-15 14:58:07,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:07,409 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:07,409 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:07,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1288202847, now seen corresponding path program 20 times [2018-10-15 14:58:07,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 462 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:08,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:08,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 14:58:08,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 14:58:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 14:58:08,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:58:08,507 INFO L87 Difference]: Start difference. First operand 228 states and 229 transitions. Second operand 39 states. [2018-10-15 14:58:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:10,260 INFO L93 Difference]: Finished difference Result 254 states and 255 transitions. [2018-10-15 14:58:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 14:58:10,263 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 227 [2018-10-15 14:58:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:10,265 INFO L225 Difference]: With dead ends: 254 [2018-10-15 14:58:10,265 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 14:58:10,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 14:58:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 14:58:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2018-10-15 14:58:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 14:58:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-10-15 14:58:10,271 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 227 [2018-10-15 14:58:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:10,272 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-10-15 14:58:10,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 14:58:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-10-15 14:58:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 14:58:10,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:10,273 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:10,274 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:10,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -12930038, now seen corresponding path program 21 times [2018-10-15 14:58:10,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 726 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:11,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:11,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 14:58:11,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 14:58:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 14:58:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 14:58:11,058 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 49 states. [2018-10-15 14:58:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:13,469 INFO L93 Difference]: Finished difference Result 385 states and 386 transitions. [2018-10-15 14:58:13,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 14:58:13,470 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 239 [2018-10-15 14:58:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:13,471 INFO L225 Difference]: With dead ends: 385 [2018-10-15 14:58:13,471 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 14:58:13,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1854, Invalid=9276, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 14:58:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 14:58:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-15 14:58:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 14:58:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-10-15 14:58:13,477 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 239 [2018-10-15 14:58:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:13,478 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-10-15 14:58:13,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 14:58:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-10-15 14:58:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 14:58:13,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:13,479 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:13,480 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:13,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:13,480 INFO L82 PathProgramCache]: Analyzing trace with hash 242694016, now seen corresponding path program 22 times [2018-10-15 14:58:13,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 552 proven. 726 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:14,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:14,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 14:58:14,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 14:58:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 14:58:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 14:58:14,245 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 42 states. [2018-10-15 14:58:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:16,072 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2018-10-15 14:58:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 14:58:16,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 247 [2018-10-15 14:58:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:16,074 INFO L225 Difference]: With dead ends: 274 [2018-10-15 14:58:16,074 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 14:58:16,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 14:58:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 14:58:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 260. [2018-10-15 14:58:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 14:58:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-10-15 14:58:16,079 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 247 [2018-10-15 14:58:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:16,079 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-10-15 14:58:16,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 14:58:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-10-15 14:58:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 14:58:16,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:16,081 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:16,081 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:16,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1624014999, now seen corresponding path program 23 times [2018-10-15 14:58:16,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 864 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:17,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:17,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 14:58:17,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 14:58:17,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 14:58:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=2365, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 14:58:17,311 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 53 states. [2018-10-15 14:58:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:19,127 INFO L93 Difference]: Finished difference Result 417 states and 418 transitions. [2018-10-15 14:58:19,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 14:58:19,127 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 259 [2018-10-15 14:58:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:19,129 INFO L225 Difference]: With dead ends: 417 [2018-10-15 14:58:19,129 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 14:58:19,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2165, Invalid=10945, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 14:58:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 14:58:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2018-10-15 14:58:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-15 14:58:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 269 transitions. [2018-10-15 14:58:19,134 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 269 transitions. Word has length 259 [2018-10-15 14:58:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:19,134 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 269 transitions. [2018-10-15 14:58:19,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 14:58:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 269 transitions. [2018-10-15 14:58:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 14:58:19,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:19,136 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:19,136 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:19,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:19,137 INFO L82 PathProgramCache]: Analyzing trace with hash -862868513, now seen corresponding path program 24 times [2018-10-15 14:58:19,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1514 backedges. 650 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:21,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:21,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 14:58:21,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 14:58:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 14:58:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 14:58:21,680 INFO L87 Difference]: Start difference. First operand 268 states and 269 transitions. Second operand 45 states. [2018-10-15 14:58:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:24,213 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2018-10-15 14:58:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 14:58:24,214 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 267 [2018-10-15 14:58:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:24,216 INFO L225 Difference]: With dead ends: 294 [2018-10-15 14:58:24,217 INFO L226 Difference]: Without dead ends: 294 [2018-10-15 14:58:24,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 14:58:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-15 14:58:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2018-10-15 14:58:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 14:58:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-10-15 14:58:24,222 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 267 [2018-10-15 14:58:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:24,222 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-10-15 14:58:24,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 14:58:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-10-15 14:58:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 14:58:24,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:24,224 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:24,224 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:24,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash -404791992, now seen corresponding path program 25 times [2018-10-15 14:58:24,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 1014 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:25,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 14:58:25,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 14:58:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 14:58:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2743, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 14:58:25,547 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 57 states. [2018-10-15 14:58:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:28,063 INFO L93 Difference]: Finished difference Result 449 states and 450 transitions. [2018-10-15 14:58:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 14:58:28,063 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 279 [2018-10-15 14:58:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:28,064 INFO L225 Difference]: With dead ends: 449 [2018-10-15 14:58:28,064 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 14:58:28,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3938 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2500, Invalid=12752, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 14:58:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 14:58:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-15 14:58:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-15 14:58:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2018-10-15 14:58:28,070 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 279 [2018-10-15 14:58:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:28,070 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2018-10-15 14:58:28,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 14:58:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2018-10-15 14:58:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-15 14:58:28,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:28,072 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:28,072 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:28,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash -755977538, now seen corresponding path program 26 times [2018-10-15 14:58:28,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 756 proven. 1014 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:29,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:29,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 14:58:29,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 14:58:29,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 14:58:29,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 14:58:29,395 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 48 states. [2018-10-15 14:58:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:31,681 INFO L93 Difference]: Finished difference Result 314 states and 315 transitions. [2018-10-15 14:58:31,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 14:58:31,682 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 287 [2018-10-15 14:58:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:31,684 INFO L225 Difference]: With dead ends: 314 [2018-10-15 14:58:31,685 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 14:58:31,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 14:58:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 14:58:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 300. [2018-10-15 14:58:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 14:58:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2018-10-15 14:58:31,690 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 287 [2018-10-15 14:58:31,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:31,691 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2018-10-15 14:58:31,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 14:58:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2018-10-15 14:58:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 14:58:31,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:31,692 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:31,693 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:31,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:31,693 INFO L82 PathProgramCache]: Analyzing trace with hash 772279719, now seen corresponding path program 27 times [2018-10-15 14:58:31,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1932 backedges. 1176 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:33,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:33,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 14:58:33,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 14:58:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 14:58:33,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3149, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 14:58:33,088 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand 61 states. [2018-10-15 14:58:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:35,677 INFO L93 Difference]: Finished difference Result 481 states and 482 transitions. [2018-10-15 14:58:35,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 14:58:35,677 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 299 [2018-10-15 14:58:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:35,678 INFO L225 Difference]: With dead ends: 481 [2018-10-15 14:58:35,678 INFO L226 Difference]: Without dead ends: 310 [2018-10-15 14:58:35,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4570 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2859, Invalid=14697, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 14:58:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-15 14:58:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-15 14:58:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 14:58:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2018-10-15 14:58:35,683 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 299 [2018-10-15 14:58:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:35,684 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2018-10-15 14:58:35,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 14:58:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2018-10-15 14:58:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 14:58:35,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:35,686 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:35,686 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:35,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2124287005, now seen corresponding path program 28 times [2018-10-15 14:58:35,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2046 backedges. 870 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:37,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:37,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 14:58:37,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 14:58:37,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 14:58:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:58:37,129 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 51 states. [2018-10-15 14:58:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:39,830 INFO L93 Difference]: Finished difference Result 334 states and 335 transitions. [2018-10-15 14:58:39,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 14:58:39,830 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 307 [2018-10-15 14:58:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:39,832 INFO L225 Difference]: With dead ends: 334 [2018-10-15 14:58:39,833 INFO L226 Difference]: Without dead ends: 334 [2018-10-15 14:58:39,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3594, Invalid=15866, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 14:58:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-15 14:58:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 320. [2018-10-15 14:58:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 14:58:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2018-10-15 14:58:39,839 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 307 [2018-10-15 14:58:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:39,839 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2018-10-15 14:58:39,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 14:58:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2018-10-15 14:58:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 14:58:39,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:39,841 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:39,842 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:39,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:39,842 INFO L82 PathProgramCache]: Analyzing trace with hash -837332858, now seen corresponding path program 29 times [2018-10-15 14:58:39,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2220 backedges. 1350 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:41,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:41,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 14:58:41,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 14:58:41,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 14:58:41,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=3583, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 14:58:41,078 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 65 states. [2018-10-15 14:58:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:44,267 INFO L93 Difference]: Finished difference Result 513 states and 514 transitions. [2018-10-15 14:58:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 14:58:44,268 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 319 [2018-10-15 14:58:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:44,269 INFO L225 Difference]: With dead ends: 513 [2018-10-15 14:58:44,269 INFO L226 Difference]: Without dead ends: 330 [2018-10-15 14:58:44,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5249 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3242, Invalid=16780, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 14:58:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-15 14:58:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-10-15 14:58:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-15 14:58:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2018-10-15 14:58:44,275 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 319 [2018-10-15 14:58:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:44,275 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2018-10-15 14:58:44,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 14:58:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2018-10-15 14:58:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-15 14:58:44,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:44,277 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:44,277 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:44,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1807517700, now seen corresponding path program 30 times [2018-10-15 14:58:44,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2342 backedges. 992 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:45,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:45,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 14:58:45,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 14:58:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 14:58:45,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 14:58:45,334 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 54 states. [2018-10-15 14:58:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:48,300 INFO L93 Difference]: Finished difference Result 354 states and 355 transitions. [2018-10-15 14:58:48,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 14:58:48,301 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 327 [2018-10-15 14:58:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:48,304 INFO L225 Difference]: With dead ends: 354 [2018-10-15 14:58:48,304 INFO L226 Difference]: Without dead ends: 354 [2018-10-15 14:58:48,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4057, Invalid=17995, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 14:58:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-15 14:58:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 340. [2018-10-15 14:58:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 14:58:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 341 transitions. [2018-10-15 14:58:48,310 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 341 transitions. Word has length 327 [2018-10-15 14:58:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:48,311 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 341 transitions. [2018-10-15 14:58:48,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 14:58:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 341 transitions. [2018-10-15 14:58:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 14:58:48,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:48,313 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:48,313 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:48,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash 471262693, now seen corresponding path program 31 times [2018-10-15 14:58:48,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1536 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:49,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:49,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 14:58:49,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 14:58:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 14:58:49,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=4045, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 14:58:49,827 INFO L87 Difference]: Start difference. First operand 340 states and 341 transitions. Second operand 69 states. [2018-10-15 14:58:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:53,591 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2018-10-15 14:58:53,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 14:58:53,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 339 [2018-10-15 14:58:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:53,592 INFO L225 Difference]: With dead ends: 545 [2018-10-15 14:58:53,592 INFO L226 Difference]: Without dead ends: 350 [2018-10-15 14:58:53,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5975 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3649, Invalid=19001, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 14:58:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-15 14:58:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-15 14:58:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-15 14:58:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 349 transitions. [2018-10-15 14:58:53,598 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 349 transitions. Word has length 339 [2018-10-15 14:58:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:53,599 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 349 transitions. [2018-10-15 14:58:53,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 14:58:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 349 transitions. [2018-10-15 14:58:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 14:58:53,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:53,601 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:53,601 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:53,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash 808105563, now seen corresponding path program 32 times [2018-10-15 14:58:53,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1122 proven. 1536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:54,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:54,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 14:58:54,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 14:58:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 14:58:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 14:58:54,732 INFO L87 Difference]: Start difference. First operand 348 states and 349 transitions. Second operand 57 states. [2018-10-15 14:58:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:57,884 INFO L93 Difference]: Finished difference Result 374 states and 375 transitions. [2018-10-15 14:58:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 14:58:57,884 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 347 [2018-10-15 14:58:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:57,886 INFO L225 Difference]: With dead ends: 374 [2018-10-15 14:58:57,886 INFO L226 Difference]: Without dead ends: 374 [2018-10-15 14:58:57,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 14:58:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-15 14:58:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 360. [2018-10-15 14:58:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-15 14:58:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2018-10-15 14:58:57,892 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 347 [2018-10-15 14:58:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:57,892 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2018-10-15 14:58:57,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 14:58:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2018-10-15 14:58:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 14:58:57,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:57,894 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:57,895 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:57,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1404079556, now seen corresponding path program 33 times [2018-10-15 14:58:57,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 1734 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:59,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:59,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 14:58:59,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 14:58:59,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 14:58:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=4535, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 14:58:59,636 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 73 states. [2018-10-15 14:59:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:03,575 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2018-10-15 14:59:03,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 14:59:03,575 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 359 [2018-10-15 14:59:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:03,577 INFO L225 Difference]: With dead ends: 577 [2018-10-15 14:59:03,577 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 14:59:03,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6748 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4080, Invalid=21360, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 14:59:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 14:59:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2018-10-15 14:59:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 14:59:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2018-10-15 14:59:03,582 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 359 [2018-10-15 14:59:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:03,583 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2018-10-15 14:59:03,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 14:59:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2018-10-15 14:59:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-15 14:59:03,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:03,585 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:03,585 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:03,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1237481670, now seen corresponding path program 34 times [2018-10-15 14:59:03,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2994 backedges. 1260 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:05,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:05,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 14:59:05,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 14:59:05,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 14:59:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 14:59:05,099 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 60 states. [2018-10-15 14:59:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:08,373 INFO L93 Difference]: Finished difference Result 394 states and 395 transitions. [2018-10-15 14:59:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 14:59:08,374 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 367 [2018-10-15 14:59:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:08,376 INFO L225 Difference]: With dead ends: 394 [2018-10-15 14:59:08,376 INFO L226 Difference]: Without dead ends: 394 [2018-10-15 14:59:08,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 14:59:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-15 14:59:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 380. [2018-10-15 14:59:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 14:59:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 381 transitions. [2018-10-15 14:59:08,382 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 381 transitions. Word has length 367 [2018-10-15 14:59:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:08,382 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 381 transitions. [2018-10-15 14:59:08,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 14:59:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 381 transitions. [2018-10-15 14:59:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 14:59:08,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:08,384 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:08,384 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:08,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2010249181, now seen corresponding path program 35 times [2018-10-15 14:59:08,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1944 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:10,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:10,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 14:59:10,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 14:59:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 14:59:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=5053, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 14:59:10,220 INFO L87 Difference]: Start difference. First operand 380 states and 381 transitions. Second operand 77 states. [2018-10-15 14:59:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:13,430 INFO L93 Difference]: Finished difference Result 609 states and 610 transitions. [2018-10-15 14:59:13,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 14:59:13,430 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 379 [2018-10-15 14:59:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:13,432 INFO L225 Difference]: With dead ends: 609 [2018-10-15 14:59:13,432 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 14:59:13,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7568 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4535, Invalid=23857, Unknown=0, NotChecked=0, Total=28392 [2018-10-15 14:59:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 14:59:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2018-10-15 14:59:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-15 14:59:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 389 transitions. [2018-10-15 14:59:13,438 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 389 transitions. Word has length 379 [2018-10-15 14:59:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:13,438 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 389 transitions. [2018-10-15 14:59:13,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 14:59:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 389 transitions. [2018-10-15 14:59:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-15 14:59:13,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:13,441 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:13,441 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:13,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:13,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1039816039, now seen corresponding path program 36 times [2018-10-15 14:59:13,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 1406 proven. 1944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:14,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 14:59:14,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 14:59:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 14:59:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:59:14,854 INFO L87 Difference]: Start difference. First operand 388 states and 389 transitions. Second operand 63 states. [2018-10-15 14:59:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:18,408 INFO L93 Difference]: Finished difference Result 414 states and 415 transitions. [2018-10-15 14:59:18,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 14:59:18,408 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 387 [2018-10-15 14:59:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:18,411 INFO L225 Difference]: With dead ends: 414 [2018-10-15 14:59:18,411 INFO L226 Difference]: Without dead ends: 414 [2018-10-15 14:59:18,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 14:59:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-15 14:59:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 400. [2018-10-15 14:59:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-15 14:59:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2018-10-15 14:59:18,416 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 387 [2018-10-15 14:59:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:18,417 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2018-10-15 14:59:18,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 14:59:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2018-10-15 14:59:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 14:59:18,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:18,418 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:18,419 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:18,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:18,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1804004094, now seen corresponding path program 37 times [2018-10-15 14:59:18,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 2166 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:20,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:20,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 14:59:20,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 14:59:20,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 14:59:20,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=5599, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 14:59:20,662 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 81 states. [2018-10-15 14:59:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:25,385 INFO L93 Difference]: Finished difference Result 641 states and 642 transitions. [2018-10-15 14:59:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 14:59:25,385 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 399 [2018-10-15 14:59:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:25,386 INFO L225 Difference]: With dead ends: 641 [2018-10-15 14:59:25,386 INFO L226 Difference]: Without dead ends: 410 [2018-10-15 14:59:25,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5014, Invalid=26492, Unknown=0, NotChecked=0, Total=31506 [2018-10-15 14:59:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-15 14:59:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-10-15 14:59:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-15 14:59:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2018-10-15 14:59:25,391 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 399 [2018-10-15 14:59:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:25,392 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2018-10-15 14:59:25,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 14:59:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2018-10-15 14:59:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-15 14:59:25,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:25,394 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:25,395 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:25,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash 380428408, now seen corresponding path program 38 times [2018-10-15 14:59:25,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3726 backedges. 1560 proven. 2166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:26,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 14:59:26,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 14:59:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 14:59:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 14:59:26,927 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 66 states. [2018-10-15 14:59:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:30,875 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 14:59:30,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 14:59:30,875 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 407 [2018-10-15 14:59:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:30,878 INFO L225 Difference]: With dead ends: 434 [2018-10-15 14:59:30,878 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 14:59:30,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11073 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6189, Invalid=27851, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 14:59:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 14:59:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 420. [2018-10-15 14:59:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 14:59:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-15 14:59:30,884 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 407 [2018-10-15 14:59:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:30,885 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-15 14:59:30,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 14:59:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-15 14:59:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 14:59:30,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:30,887 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:30,888 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:30,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 186348641, now seen corresponding path program 39 times [2018-10-15 14:59:30,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2400 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:32,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:32,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 14:59:32,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 14:59:32,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 14:59:32,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=6173, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 14:59:32,924 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 85 states. [2018-10-15 14:59:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:38,081 INFO L93 Difference]: Finished difference Result 673 states and 674 transitions. [2018-10-15 14:59:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 14:59:38,081 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 419 [2018-10-15 14:59:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:38,082 INFO L225 Difference]: With dead ends: 673 [2018-10-15 14:59:38,082 INFO L226 Difference]: Without dead ends: 430 [2018-10-15 14:59:38,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9349 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5517, Invalid=29265, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 14:59:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-15 14:59:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2018-10-15 14:59:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 14:59:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 429 transitions. [2018-10-15 14:59:38,088 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 429 transitions. Word has length 419 [2018-10-15 14:59:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:38,088 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 429 transitions. [2018-10-15 14:59:38,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 14:59:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 429 transitions. [2018-10-15 14:59:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-15 14:59:38,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:38,091 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:38,091 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:38,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1896027945, now seen corresponding path program 40 times [2018-10-15 14:59:38,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4122 backedges. 1722 proven. 2400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:39,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:39,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 14:59:39,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 14:59:39,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 14:59:39,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 14:59:39,917 INFO L87 Difference]: Start difference. First operand 428 states and 429 transitions. Second operand 69 states. [2018-10-15 14:59:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:44,574 INFO L93 Difference]: Finished difference Result 454 states and 455 transitions. [2018-10-15 14:59:44,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 14:59:44,574 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 427 [2018-10-15 14:59:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:44,577 INFO L225 Difference]: With dead ends: 454 [2018-10-15 14:59:44,577 INFO L226 Difference]: Without dead ends: 454 [2018-10-15 14:59:44,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 14:59:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-15 14:59:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2018-10-15 14:59:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-15 14:59:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2018-10-15 14:59:44,583 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 427 [2018-10-15 14:59:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:44,583 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2018-10-15 14:59:44,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 14:59:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2018-10-15 14:59:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 14:59:44,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:44,586 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:44,586 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:44,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:44,587 INFO L82 PathProgramCache]: Analyzing trace with hash 641656384, now seen corresponding path program 41 times [2018-10-15 14:59:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4368 backedges. 2646 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:46,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:46,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 14:59:46,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 14:59:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 14:59:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=6775, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 14:59:46,641 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 89 states. [2018-10-15 14:59:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:51,967 INFO L93 Difference]: Finished difference Result 705 states and 706 transitions. [2018-10-15 14:59:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 14:59:51,967 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 439 [2018-10-15 14:59:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:51,968 INFO L225 Difference]: With dead ends: 705 [2018-10-15 14:59:51,969 INFO L226 Difference]: Without dead ends: 450 [2018-10-15 14:59:51,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10310 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6044, Invalid=32176, Unknown=0, NotChecked=0, Total=38220 [2018-10-15 14:59:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-15 14:59:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-10-15 14:59:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-15 14:59:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2018-10-15 14:59:51,974 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 439 [2018-10-15 14:59:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:51,974 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2018-10-15 14:59:51,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 14:59:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2018-10-15 14:59:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-10-15 14:59:51,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:51,976 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:51,976 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:51,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash 224363446, now seen corresponding path program 42 times [2018-10-15 14:59:51,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4538 backedges. 1892 proven. 2646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:53,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:53,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 14:59:53,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 14:59:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 14:59:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 14:59:53,541 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 72 states. [2018-10-15 14:59:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:58,538 INFO L93 Difference]: Finished difference Result 474 states and 475 transitions. [2018-10-15 14:59:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 14:59:58,538 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 447 [2018-10-15 14:59:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:58,541 INFO L225 Difference]: With dead ends: 474 [2018-10-15 14:59:58,541 INFO L226 Difference]: Without dead ends: 474 [2018-10-15 14:59:58,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13413 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7423, Invalid=33583, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 14:59:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-10-15 14:59:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 460. [2018-10-15 14:59:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-15 14:59:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2018-10-15 14:59:58,548 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 447 [2018-10-15 14:59:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:58,548 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 461 transitions. [2018-10-15 14:59:58,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 14:59:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 461 transitions. [2018-10-15 14:59:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 14:59:58,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:58,551 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:58,551 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:58,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1213388129, now seen corresponding path program 43 times [2018-10-15 14:59:58,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4796 backedges. 2904 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:01,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:01,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:00:01,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:00:01,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:00:01,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=7405, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:00:01,210 INFO L87 Difference]: Start difference. First operand 460 states and 461 transitions. Second operand 93 states. [2018-10-15 15:00:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:07,503 INFO L93 Difference]: Finished difference Result 737 states and 738 transitions. [2018-10-15 15:00:07,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 15:00:07,503 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 459 [2018-10-15 15:00:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:07,504 INFO L225 Difference]: With dead ends: 737 [2018-10-15 15:00:07,504 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 15:00:07,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11318 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6595, Invalid=35225, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 15:00:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 15:00:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2018-10-15 15:00:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-10-15 15:00:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 469 transitions. [2018-10-15 15:00:07,509 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 469 transitions. Word has length 459 [2018-10-15 15:00:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:07,510 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 469 transitions. [2018-10-15 15:00:07,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:00:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 469 transitions. [2018-10-15 15:00:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-10-15 15:00:07,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:07,513 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:07,513 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:07,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1809740053, now seen corresponding path program 44 times [2018-10-15 15:00:07,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4974 backedges. 2070 proven. 2904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:09,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:09,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:00:09,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:00:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:00:09,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:00:09,237 INFO L87 Difference]: Start difference. First operand 468 states and 469 transitions. Second operand 75 states. [2018-10-15 15:00:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:14,750 INFO L93 Difference]: Finished difference Result 494 states and 495 transitions. [2018-10-15 15:00:14,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 15:00:14,751 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 467 [2018-10-15 15:00:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:14,752 INFO L225 Difference]: With dead ends: 494 [2018-10-15 15:00:14,752 INFO L226 Difference]: Without dead ends: 494 [2018-10-15 15:00:14,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 15:00:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-10-15 15:00:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 480. [2018-10-15 15:00:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 15:00:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2018-10-15 15:00:14,758 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 467 [2018-10-15 15:00:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:14,758 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2018-10-15 15:00:14,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:00:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2018-10-15 15:00:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 15:00:14,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:14,760 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:14,761 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:14,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash 416285054, now seen corresponding path program 45 times [2018-10-15 15:00:14,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 3174 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:17,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:17,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:00:17,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:00:17,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:00:17,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=8063, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:00:17,239 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 97 states. [2018-10-15 15:00:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:23,839 INFO L93 Difference]: Finished difference Result 769 states and 770 transitions. [2018-10-15 15:00:23,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:00:23,840 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 479 [2018-10-15 15:00:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:23,841 INFO L225 Difference]: With dead ends: 769 [2018-10-15 15:00:23,841 INFO L226 Difference]: Without dead ends: 490 [2018-10-15 15:00:23,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12373 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7170, Invalid=38412, Unknown=0, NotChecked=0, Total=45582 [2018-10-15 15:00:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-15 15:00:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2018-10-15 15:00:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-15 15:00:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2018-10-15 15:00:23,848 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 479 [2018-10-15 15:00:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:23,848 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2018-10-15 15:00:23,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:00:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2018-10-15 15:00:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-15 15:00:23,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:23,851 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:23,852 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:23,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1814262004, now seen corresponding path program 46 times [2018-10-15 15:00:23,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2256 proven. 3174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:25,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:25,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 15:00:25,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 15:00:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 15:00:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:00:25,918 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 78 states. [2018-10-15 15:00:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:31,829 INFO L93 Difference]: Finished difference Result 514 states and 515 transitions. [2018-10-15 15:00:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 15:00:31,829 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 487 [2018-10-15 15:00:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:31,832 INFO L225 Difference]: With dead ends: 514 [2018-10-15 15:00:31,832 INFO L226 Difference]: Without dead ends: 514 [2018-10-15 15:00:31,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 15:00:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-10-15 15:00:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2018-10-15 15:00:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 15:00:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 501 transitions. [2018-10-15 15:00:31,838 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 501 transitions. Word has length 487 [2018-10-15 15:00:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:31,839 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 501 transitions. [2018-10-15 15:00:31,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 15:00:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 501 transitions. [2018-10-15 15:00:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 15:00:31,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:31,841 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:31,841 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:31,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash 447818461, now seen corresponding path program 47 times [2018-10-15 15:00:31,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5712 backedges. 3456 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:34,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:34,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:00:34,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:00:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:00:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1351, Invalid=8749, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:00:34,785 INFO L87 Difference]: Start difference. First operand 500 states and 501 transitions. Second operand 101 states. [2018-10-15 15:00:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:42,082 INFO L93 Difference]: Finished difference Result 801 states and 802 transitions. [2018-10-15 15:00:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 15:00:42,082 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 499 [2018-10-15 15:00:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:42,084 INFO L225 Difference]: With dead ends: 801 [2018-10-15 15:00:42,084 INFO L226 Difference]: Without dead ends: 510 [2018-10-15 15:00:42,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13475 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7769, Invalid=41737, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 15:00:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-15 15:00:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2018-10-15 15:00:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-15 15:00:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 509 transitions. [2018-10-15 15:00:42,090 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 509 transitions. Word has length 499 [2018-10-15 15:00:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:42,090 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 509 transitions. [2018-10-15 15:00:42,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:00:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 509 transitions. [2018-10-15 15:00:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-10-15 15:00:42,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:42,093 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:42,093 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:42,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1485290669, now seen corresponding path program 48 times [2018-10-15 15:00:42,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5906 backedges. 2450 proven. 3456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:44,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:44,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:00:44,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:00:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:00:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:00:44,102 INFO L87 Difference]: Start difference. First operand 508 states and 509 transitions. Second operand 81 states. [2018-10-15 15:00:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:50,218 INFO L93 Difference]: Finished difference Result 534 states and 535 transitions. [2018-10-15 15:00:50,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 15:00:50,218 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 507 [2018-10-15 15:00:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:50,221 INFO L225 Difference]: With dead ends: 534 [2018-10-15 15:00:50,222 INFO L226 Difference]: Without dead ends: 534 [2018-10-15 15:00:50,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17343 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9484, Invalid=43186, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 15:00:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-15 15:00:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 520. [2018-10-15 15:00:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 15:00:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2018-10-15 15:00:50,229 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 507 [2018-10-15 15:00:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:50,229 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2018-10-15 15:00:50,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:00:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2018-10-15 15:00:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 15:00:50,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:50,232 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:50,233 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:50,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash -168139076, now seen corresponding path program 49 times [2018-10-15 15:00:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6200 backedges. 3750 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:53,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:53,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:00:53,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:00:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:00:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1457, Invalid=9463, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:00:53,340 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 105 states. [2018-10-15 15:00:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:59,326 INFO L93 Difference]: Finished difference Result 833 states and 834 transitions. [2018-10-15 15:00:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 15:00:59,327 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 519 [2018-10-15 15:00:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:59,329 INFO L225 Difference]: With dead ends: 833 [2018-10-15 15:00:59,329 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 15:00:59,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14624 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8392, Invalid=45200, Unknown=0, NotChecked=0, Total=53592 [2018-10-15 15:00:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 15:00:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2018-10-15 15:00:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 15:00:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2018-10-15 15:00:59,334 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 519 [2018-10-15 15:00:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:59,334 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2018-10-15 15:00:59,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:00:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2018-10-15 15:00:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 15:00:59,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:59,337 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:59,337 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:59,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2126948402, now seen corresponding path program 50 times [2018-10-15 15:00:59,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6402 backedges. 2652 proven. 3750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:01,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 15:01:01,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 15:01:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 15:01:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:01:01,666 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 84 states. [2018-10-15 15:01:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:08,254 INFO L93 Difference]: Finished difference Result 554 states and 555 transitions. [2018-10-15 15:01:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:01:08,254 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 527 [2018-10-15 15:01:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:08,256 INFO L225 Difference]: With dead ends: 554 [2018-10-15 15:01:08,256 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 15:01:08,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18765 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10227, Invalid=46655, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:01:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 15:01:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 540. [2018-10-15 15:01:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-15 15:01:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 541 transitions. [2018-10-15 15:01:08,263 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 541 transitions. Word has length 527 [2018-10-15 15:01:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:08,263 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 541 transitions. [2018-10-15 15:01:08,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 15:01:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 541 transitions. [2018-10-15 15:01:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 15:01:08,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:08,266 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:08,266 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:08,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 989164827, now seen corresponding path program 51 times [2018-10-15 15:01:08,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6708 backedges. 4056 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:11,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:11,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:01:11,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:01:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:01:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=10205, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:01:11,600 INFO L87 Difference]: Start difference. First operand 540 states and 541 transitions. Second operand 109 states. [2018-10-15 15:01:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:19,891 INFO L93 Difference]: Finished difference Result 865 states and 866 transitions. [2018-10-15 15:01:19,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 15:01:19,892 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 539 [2018-10-15 15:01:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:19,893 INFO L225 Difference]: With dead ends: 865 [2018-10-15 15:01:19,893 INFO L226 Difference]: Without dead ends: 550 [2018-10-15 15:01:19,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15820 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=9039, Invalid=48801, Unknown=0, NotChecked=0, Total=57840 [2018-10-15 15:01:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-15 15:01:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2018-10-15 15:01:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-10-15 15:01:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 549 transitions. [2018-10-15 15:01:19,899 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 549 transitions. Word has length 539 [2018-10-15 15:01:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:19,899 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 549 transitions. [2018-10-15 15:01:19,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:01:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 549 transitions. [2018-10-15 15:01:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-10-15 15:01:19,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:19,901 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:19,902 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:19,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash 177758097, now seen corresponding path program 52 times [2018-10-15 15:01:19,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6918 backedges. 2862 proven. 4056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:22,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:22,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:01:22,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:01:22,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:01:22,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:01:22,537 INFO L87 Difference]: Start difference. First operand 548 states and 549 transitions. Second operand 87 states. [2018-10-15 15:01:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:29,837 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2018-10-15 15:01:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 15:01:29,837 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 547 [2018-10-15 15:01:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:29,839 INFO L225 Difference]: With dead ends: 574 [2018-10-15 15:01:29,839 INFO L226 Difference]: Without dead ends: 574 [2018-10-15 15:01:29,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20243 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10998, Invalid=50258, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 15:01:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-15 15:01:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 560. [2018-10-15 15:01:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 15:01:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2018-10-15 15:01:29,846 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 547 [2018-10-15 15:01:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:29,846 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2018-10-15 15:01:29,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:01:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2018-10-15 15:01:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 15:01:29,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:29,849 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:29,849 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:29,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1047783942, now seen corresponding path program 53 times [2018-10-15 15:01:29,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7236 backedges. 4374 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:33,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:33,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:01:33,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:01:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:01:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1681, Invalid=10975, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:01:33,576 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 113 states. [2018-10-15 15:01:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:42,713 INFO L93 Difference]: Finished difference Result 897 states and 898 transitions. [2018-10-15 15:01:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 15:01:42,713 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 559 [2018-10-15 15:01:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:42,715 INFO L225 Difference]: With dead ends: 897 [2018-10-15 15:01:42,715 INFO L226 Difference]: Without dead ends: 570 [2018-10-15 15:01:42,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17063 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=9710, Invalid=52540, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 15:01:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-15 15:01:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2018-10-15 15:01:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-10-15 15:01:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2018-10-15 15:01:42,721 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 559 [2018-10-15 15:01:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:42,721 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2018-10-15 15:01:42,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:01:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2018-10-15 15:01:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-15 15:01:42,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:42,724 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:42,724 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:42,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 186067312, now seen corresponding path program 54 times [2018-10-15 15:01:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7454 backedges. 3080 proven. 4374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:45,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:45,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 15:01:45,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 15:01:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 15:01:45,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:01:45,130 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 90 states. [2018-10-15 15:01:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:52,961 INFO L93 Difference]: Finished difference Result 594 states and 595 transitions. [2018-10-15 15:01:52,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 15:01:52,962 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 567 [2018-10-15 15:01:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:52,965 INFO L225 Difference]: With dead ends: 594 [2018-10-15 15:01:52,965 INFO L226 Difference]: Without dead ends: 594 [2018-10-15 15:01:52,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11797, Invalid=53995, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 15:01:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-10-15 15:01:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 580. [2018-10-15 15:01:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-15 15:01:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 581 transitions. [2018-10-15 15:01:52,973 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 581 transitions. Word has length 567 [2018-10-15 15:01:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:52,973 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 581 transitions. [2018-10-15 15:01:52,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 15:01:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 581 transitions. [2018-10-15 15:01:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 15:01:52,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:52,976 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:52,976 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:52,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:52,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1723332263, now seen corresponding path program 55 times [2018-10-15 15:01:52,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7784 backedges. 4704 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:56,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:56,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:01:56,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:01:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:01:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1799, Invalid=11773, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:01:56,602 INFO L87 Difference]: Start difference. First operand 580 states and 581 transitions. Second operand 117 states. [2018-10-15 15:02:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:04,615 INFO L93 Difference]: Finished difference Result 929 states and 930 transitions. [2018-10-15 15:02:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 15:02:04,616 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 579 [2018-10-15 15:02:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:04,618 INFO L225 Difference]: With dead ends: 929 [2018-10-15 15:02:04,618 INFO L226 Difference]: Without dead ends: 590 [2018-10-15 15:02:04,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18353 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=10405, Invalid=56417, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 15:02:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-15 15:02:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2018-10-15 15:02:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-15 15:02:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 589 transitions. [2018-10-15 15:02:04,623 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 589 transitions. Word has length 579 [2018-10-15 15:02:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:04,623 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 589 transitions. [2018-10-15 15:02:04,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:02:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 589 transitions. [2018-10-15 15:02:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-10-15 15:02:04,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:04,626 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:04,626 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:04,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -670251569, now seen corresponding path program 56 times [2018-10-15 15:02:04,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 3306 proven. 4704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:07,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:07,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:02:07,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:02:07,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:02:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:02:07,206 INFO L87 Difference]: Start difference. First operand 588 states and 589 transitions. Second operand 93 states. [2018-10-15 15:02:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:15,438 INFO L93 Difference]: Finished difference Result 614 states and 615 transitions. [2018-10-15 15:02:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 15:02:15,439 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 587 [2018-10-15 15:02:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:15,442 INFO L225 Difference]: With dead ends: 614 [2018-10-15 15:02:15,442 INFO L226 Difference]: Without dead ends: 614 [2018-10-15 15:02:15,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12624, Invalid=57866, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 15:02:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-15 15:02:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 600. [2018-10-15 15:02:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-15 15:02:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2018-10-15 15:02:15,449 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 587 [2018-10-15 15:02:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:15,449 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 601 transitions. [2018-10-15 15:02:15,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:02:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 601 transitions. [2018-10-15 15:02:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 15:02:15,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:15,452 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:15,452 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:15,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:15,452 INFO L82 PathProgramCache]: Analyzing trace with hash -111997128, now seen corresponding path program 57 times [2018-10-15 15:02:15,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8352 backedges. 5046 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:19,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:19,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:02:19,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:02:19,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:02:19,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1921, Invalid=12599, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:02:19,477 INFO L87 Difference]: Start difference. First operand 600 states and 601 transitions. Second operand 121 states. [2018-10-15 15:02:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:27,002 INFO L93 Difference]: Finished difference Result 961 states and 962 transitions. [2018-10-15 15:02:27,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 15:02:27,002 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 599 [2018-10-15 15:02:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:27,004 INFO L225 Difference]: With dead ends: 961 [2018-10-15 15:02:27,004 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 15:02:27,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19690 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=11124, Invalid=60432, Unknown=0, NotChecked=0, Total=71556 [2018-10-15 15:02:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 15:02:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2018-10-15 15:02:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-15 15:02:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2018-10-15 15:02:27,010 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 599 [2018-10-15 15:02:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:27,010 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2018-10-15 15:02:27,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:02:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2018-10-15 15:02:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-10-15 15:02:27,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:27,013 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:27,013 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:27,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1357051054, now seen corresponding path program 58 times [2018-10-15 15:02:27,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8586 backedges. 3540 proven. 5046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:30,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:30,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 15:02:30,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 15:02:30,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 15:02:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 15:02:30,121 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 96 states. [2018-10-15 15:02:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:38,893 INFO L93 Difference]: Finished difference Result 634 states and 635 transitions. [2018-10-15 15:02:38,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 15:02:38,893 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 607 [2018-10-15 15:02:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:38,896 INFO L225 Difference]: With dead ends: 634 [2018-10-15 15:02:38,897 INFO L226 Difference]: Without dead ends: 634 [2018-10-15 15:02:38,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13479, Invalid=61871, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:02:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-10-15 15:02:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 620. [2018-10-15 15:02:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-15 15:02:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 621 transitions. [2018-10-15 15:02:38,904 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 621 transitions. Word has length 607 [2018-10-15 15:02:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:38,904 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 621 transitions. [2018-10-15 15:02:38,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 15:02:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 621 transitions. [2018-10-15 15:02:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 15:02:38,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:38,907 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:38,908 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:38,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash 813098903, now seen corresponding path program 59 times [2018-10-15 15:02:38,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8940 backedges. 5400 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:42,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:42,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:02:42,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:02:42,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:02:42,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=13453, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:02:42,881 INFO L87 Difference]: Start difference. First operand 620 states and 621 transitions. Second operand 125 states. [2018-10-15 15:02:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:54,067 INFO L93 Difference]: Finished difference Result 993 states and 994 transitions. [2018-10-15 15:02:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:02:54,067 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 619 [2018-10-15 15:02:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:54,069 INFO L225 Difference]: With dead ends: 993 [2018-10-15 15:02:54,069 INFO L226 Difference]: Without dead ends: 630 [2018-10-15 15:02:54,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21074 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=11867, Invalid=64585, Unknown=0, NotChecked=0, Total=76452 [2018-10-15 15:02:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-15 15:02:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2018-10-15 15:02:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-15 15:02:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 629 transitions. [2018-10-15 15:02:54,075 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 629 transitions. Word has length 619 [2018-10-15 15:02:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:54,076 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 629 transitions. [2018-10-15 15:02:54,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:02:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 629 transitions. [2018-10-15 15:02:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-15 15:02:54,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:54,079 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:54,079 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:54,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:54,079 INFO L82 PathProgramCache]: Analyzing trace with hash -861702643, now seen corresponding path program 60 times [2018-10-15 15:02:54,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9182 backedges. 3782 proven. 5400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:57,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:57,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:02:57,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:02:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:02:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:02:57,042 INFO L87 Difference]: Start difference. First operand 628 states and 629 transitions. Second operand 99 states. [2018-10-15 15:03:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:06,248 INFO L93 Difference]: Finished difference Result 654 states and 655 transitions. [2018-10-15 15:03:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 15:03:06,248 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 627 [2018-10-15 15:03:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:06,252 INFO L225 Difference]: With dead ends: 654 [2018-10-15 15:03:06,252 INFO L226 Difference]: Without dead ends: 654 [2018-10-15 15:03:06,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26715 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14362, Invalid=66010, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 15:03:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-10-15 15:03:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 640. [2018-10-15 15:03:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-15 15:03:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 641 transitions. [2018-10-15 15:03:06,258 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 641 transitions. Word has length 627 [2018-10-15 15:03:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:06,258 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 641 transitions. [2018-10-15 15:03:06,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:03:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 641 transitions. [2018-10-15 15:03:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 15:03:06,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:06,261 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:06,262 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:06,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1793240458, now seen corresponding path program 61 times [2018-10-15 15:03:06,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9548 backedges. 5766 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:10,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:10,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:03:10,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:03:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:03:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2177, Invalid=14335, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:03:10,762 INFO L87 Difference]: Start difference. First operand 640 states and 641 transitions. Second operand 129 states. [2018-10-15 15:03:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:22,533 INFO L93 Difference]: Finished difference Result 1025 states and 1026 transitions. [2018-10-15 15:03:22,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 15:03:22,534 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 639 [2018-10-15 15:03:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:22,536 INFO L225 Difference]: With dead ends: 1025 [2018-10-15 15:03:22,536 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 15:03:22,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22505 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=12634, Invalid=68876, Unknown=0, NotChecked=0, Total=81510 [2018-10-15 15:03:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 15:03:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-10-15 15:03:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-10-15 15:03:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 649 transitions. [2018-10-15 15:03:22,543 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 649 transitions. Word has length 639 [2018-10-15 15:03:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:22,543 INFO L481 AbstractCegarLoop]: Abstraction has 648 states and 649 transitions. [2018-10-15 15:03:22,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:03:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 649 transitions. [2018-10-15 15:03:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-10-15 15:03:22,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:22,546 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:22,546 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:22,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 167250412, now seen corresponding path program 62 times [2018-10-15 15:03:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9798 backedges. 4032 proven. 5766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:25,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 15:03:25,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 15:03:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 15:03:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:03:25,887 INFO L87 Difference]: Start difference. First operand 648 states and 649 transitions. Second operand 102 states. [2018-10-15 15:03:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:35,702 INFO L93 Difference]: Finished difference Result 674 states and 675 transitions. [2018-10-15 15:03:35,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 15:03:35,702 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 647 [2018-10-15 15:03:35,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:35,704 INFO L225 Difference]: With dead ends: 674 [2018-10-15 15:03:35,705 INFO L226 Difference]: Without dead ends: 674 [2018-10-15 15:03:35,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 15:03:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-15 15:03:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 660. [2018-10-15 15:03:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-15 15:03:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 661 transitions. [2018-10-15 15:03:35,711 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 661 transitions. Word has length 647 [2018-10-15 15:03:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:35,712 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 661 transitions. [2018-10-15 15:03:35,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 15:03:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 661 transitions. [2018-10-15 15:03:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 15:03:35,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:35,716 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:35,716 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:35,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1968181205, now seen corresponding path program 63 times [2018-10-15 15:03:35,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10176 backedges. 6144 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:40,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:40,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:03:40,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:03:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:03:40,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2311, Invalid=15245, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:03:40,380 INFO L87 Difference]: Start difference. First operand 660 states and 661 transitions. Second operand 133 states. [2018-10-15 15:03:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:53,148 INFO L93 Difference]: Finished difference Result 1057 states and 1058 transitions. [2018-10-15 15:03:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 15:03:53,148 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 659 [2018-10-15 15:03:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:53,151 INFO L225 Difference]: With dead ends: 1057 [2018-10-15 15:03:53,151 INFO L226 Difference]: Without dead ends: 670 [2018-10-15 15:03:53,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23983 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=13425, Invalid=73305, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 15:03:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-15 15:03:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2018-10-15 15:03:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-10-15 15:03:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 669 transitions. [2018-10-15 15:03:53,157 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 669 transitions. Word has length 659 [2018-10-15 15:03:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:53,158 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 669 transitions. [2018-10-15 15:03:53,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:03:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 669 transitions. [2018-10-15 15:03:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-10-15 15:03:53,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:53,161 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:53,161 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:53,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash 522874955, now seen corresponding path program 64 times [2018-10-15 15:03:53,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10434 backedges. 4290 proven. 6144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:56,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:56,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:03:56,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:03:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:03:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:03:56,674 INFO L87 Difference]: Start difference. First operand 668 states and 669 transitions. Second operand 105 states. [2018-10-15 15:04:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:06,313 INFO L93 Difference]: Finished difference Result 694 states and 695 transitions. [2018-10-15 15:04:06,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 15:04:06,313 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 667 [2018-10-15 15:04:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:06,315 INFO L225 Difference]: With dead ends: 694 [2018-10-15 15:04:06,315 INFO L226 Difference]: Without dead ends: 694 [2018-10-15 15:04:06,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 15:04:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-10-15 15:04:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 680. [2018-10-15 15:04:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 15:04:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 681 transitions. [2018-10-15 15:04:06,322 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 681 transitions. Word has length 667 [2018-10-15 15:04:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:06,322 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 681 transitions. [2018-10-15 15:04:06,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:04:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 681 transitions. [2018-10-15 15:04:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 15:04:06,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:06,326 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:06,326 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:06,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 112779188, now seen corresponding path program 65 times [2018-10-15 15:04:06,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 6534 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:11,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:11,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:04:11,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:04:11,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:04:11,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=16183, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:04:11,295 INFO L87 Difference]: Start difference. First operand 680 states and 681 transitions. Second operand 137 states. [2018-10-15 15:04:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:24,752 INFO L93 Difference]: Finished difference Result 1089 states and 1090 transitions. [2018-10-15 15:04:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 15:04:24,752 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 679 [2018-10-15 15:04:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:24,754 INFO L225 Difference]: With dead ends: 1089 [2018-10-15 15:04:24,754 INFO L226 Difference]: Without dead ends: 690 [2018-10-15 15:04:24,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25508 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14240, Invalid=77872, Unknown=0, NotChecked=0, Total=92112 [2018-10-15 15:04:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-10-15 15:04:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-10-15 15:04:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-10-15 15:04:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 689 transitions. [2018-10-15 15:04:24,760 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 689 transitions. Word has length 679 [2018-10-15 15:04:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:24,760 INFO L481 AbstractCegarLoop]: Abstraction has 688 states and 689 transitions. [2018-10-15 15:04:24,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:04:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 689 transitions. [2018-10-15 15:04:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-10-15 15:04:24,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:24,764 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:24,764 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:24,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1780771114, now seen corresponding path program 66 times [2018-10-15 15:04:24,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11090 backedges. 4556 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:28,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:28,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 15:04:28,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 15:04:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 15:04:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 15:04:28,454 INFO L87 Difference]: Start difference. First operand 688 states and 689 transitions. Second operand 108 states. [2018-10-15 15:04:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:38,519 INFO L93 Difference]: Finished difference Result 714 states and 715 transitions. [2018-10-15 15:04:38,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 15:04:38,519 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 687 [2018-10-15 15:04:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:38,523 INFO L225 Difference]: With dead ends: 714 [2018-10-15 15:04:38,523 INFO L226 Difference]: Without dead ends: 714 [2018-10-15 15:04:38,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 15:04:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-10-15 15:04:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 700. [2018-10-15 15:04:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-15 15:04:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 701 transitions. [2018-10-15 15:04:38,529 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 701 transitions. Word has length 687 [2018-10-15 15:04:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:38,530 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 701 transitions. [2018-10-15 15:04:38,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 15:04:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 701 transitions. [2018-10-15 15:04:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 15:04:38,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:38,533 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:38,533 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:38,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1453425171, now seen corresponding path program 67 times [2018-10-15 15:04:38,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11492 backedges. 6936 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:43,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:43,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 15:04:43,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 15:04:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 15:04:43,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2591, Invalid=17149, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:04:43,799 INFO L87 Difference]: Start difference. First operand 700 states and 701 transitions. Second operand 141 states. [2018-10-15 15:04:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:58,329 INFO L93 Difference]: Finished difference Result 1121 states and 1122 transitions. [2018-10-15 15:04:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 15:04:58,329 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 699 [2018-10-15 15:04:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:58,332 INFO L225 Difference]: With dead ends: 1121 [2018-10-15 15:04:58,332 INFO L226 Difference]: Without dead ends: 710 [2018-10-15 15:04:58,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27080 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=15079, Invalid=82577, Unknown=0, NotChecked=0, Total=97656 [2018-10-15 15:04:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-10-15 15:04:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 708. [2018-10-15 15:04:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-10-15 15:04:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 709 transitions. [2018-10-15 15:04:58,368 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 709 transitions. Word has length 699 [2018-10-15 15:04:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:58,368 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 709 transitions. [2018-10-15 15:04:58,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 15:04:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 709 transitions. [2018-10-15 15:04:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-10-15 15:04:58,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:58,371 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:58,372 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:58,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:58,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2140162935, now seen corresponding path program 68 times [2018-10-15 15:04:58,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11766 backedges. 4830 proven. 6936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:05:02,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:05:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:05:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=10133, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:05:02,161 INFO L87 Difference]: Start difference. First operand 708 states and 709 transitions. Second operand 111 states. [2018-10-15 15:05:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:12,466 INFO L93 Difference]: Finished difference Result 734 states and 735 transitions. [2018-10-15 15:05:12,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-10-15 15:05:12,466 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 707 [2018-10-15 15:05:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:12,470 INFO L225 Difference]: With dead ends: 734 [2018-10-15 15:05:12,470 INFO L226 Difference]: Without dead ends: 734 [2018-10-15 15:05:12,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34083 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=18174, Invalid=83906, Unknown=0, NotChecked=0, Total=102080 [2018-10-15 15:05:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-10-15 15:05:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 720. [2018-10-15 15:05:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-15 15:05:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 721 transitions. [2018-10-15 15:05:12,477 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 721 transitions. Word has length 707 [2018-10-15 15:05:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:12,477 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 721 transitions. [2018-10-15 15:05:12,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:05:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 721 transitions. [2018-10-15 15:05:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 15:05:12,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:12,481 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:12,481 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:12,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash 972273394, now seen corresponding path program 69 times [2018-10-15 15:05:12,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12180 backedges. 7350 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:17,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:17,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 15:05:17,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 15:05:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 15:05:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2737, Invalid=18143, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:05:17,973 INFO L87 Difference]: Start difference. First operand 720 states and 721 transitions. Second operand 145 states. [2018-10-15 15:05:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:33,359 INFO L93 Difference]: Finished difference Result 1153 states and 1154 transitions. [2018-10-15 15:05:33,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 15:05:33,360 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 719 [2018-10-15 15:05:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:33,362 INFO L225 Difference]: With dead ends: 1153 [2018-10-15 15:05:33,362 INFO L226 Difference]: Without dead ends: 730 [2018-10-15 15:05:33,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28699 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15942, Invalid=87420, Unknown=0, NotChecked=0, Total=103362 [2018-10-15 15:05:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-10-15 15:05:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2018-10-15 15:05:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-10-15 15:05:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 729 transitions. [2018-10-15 15:05:33,368 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 729 transitions. Word has length 719 [2018-10-15 15:05:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:33,368 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 729 transitions. [2018-10-15 15:05:33,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 15:05:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 729 transitions. [2018-10-15 15:05:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-10-15 15:05:33,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:33,372 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:33,372 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:33,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash 523637352, now seen corresponding path program 70 times [2018-10-15 15:05:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12462 backedges. 5112 proven. 7350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:37,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:37,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 15:05:37,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 15:05:37,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 15:05:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2190, Invalid=10692, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 15:05:37,110 INFO L87 Difference]: Start difference. First operand 728 states and 729 transitions. Second operand 114 states. [2018-10-15 15:05:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:48,705 INFO L93 Difference]: Finished difference Result 754 states and 755 transitions. [2018-10-15 15:05:48,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2018-10-15 15:05:48,706 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 727 [2018-10-15 15:05:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:48,710 INFO L225 Difference]: With dead ends: 754 [2018-10-15 15:05:48,710 INFO L226 Difference]: Without dead ends: 754 [2018-10-15 15:05:48,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36065 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=19197, Invalid=88715, Unknown=0, NotChecked=0, Total=107912 [2018-10-15 15:05:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-15 15:05:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 740. [2018-10-15 15:05:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-15 15:05:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 741 transitions. [2018-10-15 15:05:48,718 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 741 transitions. Word has length 727 [2018-10-15 15:05:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:48,718 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 741 transitions. [2018-10-15 15:05:48,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 15:05:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 741 transitions. [2018-10-15 15:05:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 15:05:48,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:48,722 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:48,722 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:48,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1027161681, now seen corresponding path program 71 times [2018-10-15 15:05:48,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12888 backedges. 7776 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:54,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:54,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 15:05:54,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 15:05:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 15:05:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2887, Invalid=19165, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:05:54,445 INFO L87 Difference]: Start difference. First operand 740 states and 741 transitions. Second operand 149 states.