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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/seq_true-unreach-call_true-termination.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:08:42,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:08:42,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:08:42,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:08:42,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:08:42,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:08:42,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:08:42,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:08:42,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:08:42,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:08:42,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:08:42,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:08:42,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:08:42,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:08:42,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:08:42,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:08:42,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:08:42,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:08:42,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:08:42,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:08:42,499 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:08:42,500 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:08:42,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:08:42,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:08:42,503 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:08:42,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:08:42,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:08:42,506 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:08:42,507 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:08:42,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:08:42,508 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:08:42,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:08:42,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:08:42,510 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:08:42,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:08:42,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:08:42,512 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 13:08:42,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:08:42,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:08:42,522 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:08:42,522 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:08:42,522 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:08:42,523 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:08:42,523 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:08:42,524 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:08:42,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:08:42,524 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:08:42,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:08:42,524 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:08:42,525 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:08:42,525 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:08:42,526 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:08:42,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:08:42,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:08:42,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:08:42,613 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:08:42,614 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:08:42,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/seq_true-unreach-call_true-termination.i_6.bpl [2018-10-15 13:08:42,615 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/seq_true-unreach-call_true-termination.i_6.bpl' [2018-10-15 13:08:42,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:08:42,676 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:08:42,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:08:42,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:08:42,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:08:42,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/1) ... [2018-10-15 13:08:42,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/1) ... [2018-10-15 13:08:42,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/1) ... [2018-10-15 13:08:42,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/1) ... [2018-10-15 13:08:42,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/1) ... [2018-10-15 13:08:42,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/1) ... [2018-10-15 13:08:42,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/1) ... [2018-10-15 13:08:42,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:08:42,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:08:42,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:08:42,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:08:42,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (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 13:08:42,815 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:08:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:08:42,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:08:43,239 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:08:43,240 INFO L202 PluginConnector]: Adding new model seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:43 BoogieIcfgContainer [2018-10-15 13:08:43,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:08:43,240 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:08:43,241 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:08:43,242 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:08:43,245 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:43" (1/1) ... [2018-10-15 13:08:43,250 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:08:43,267 INFO L202 PluginConnector]: Adding new model seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:08:43 BasicIcfg [2018-10-15 13:08:43,268 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:08:43,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:08:43,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:08:43,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:08:43,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:08:42" (1/3) ... [2018-10-15 13:08:43,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e05484 and model type seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:43, skipping insertion in model container [2018-10-15 13:08:43,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:43" (2/3) ... [2018-10-15 13:08:43,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e05484 and model type seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:08:43, skipping insertion in model container [2018-10-15 13:08:43,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq_true-unreach-call_true-termination.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:08:43" (3/3) ... [2018-10-15 13:08:43,276 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i_6.bplleft_unchanged_by_heapseparator [2018-10-15 13:08:43,285 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:08:43,294 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:08:43,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:08:43,341 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:08:43,341 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:08:43,342 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:08:43,342 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:08:43,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:08:43,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:08:43,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:08:43,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:08:43,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:08:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-15 13:08:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:08:43,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:43,367 INFO L375 BasicCegarLoop]: trace histogram [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 13:08:43,368 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:43,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash 128158098, now seen corresponding path program 1 times [2018-10-15 13:08:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:43,654 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 13:08:43,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:08:43,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 13:08:43,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:08:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:08:43,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:08:43,678 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 7 states. [2018-10-15 13:08:44,172 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 13:08:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:44,209 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-10-15 13:08:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:08:44,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 13:08:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:44,223 INFO L225 Difference]: With dead ends: 42 [2018-10-15 13:08:44,224 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 13:08:44,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:08:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 13:08:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-10-15 13:08:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 13:08:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-10-15 13:08:44,266 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 24 [2018-10-15 13:08:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:44,266 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-10-15 13:08:44,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:08:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-10-15 13:08:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 13:08:44,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:44,268 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-10-15 13:08:44,268 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:44,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash -146984469, now seen corresponding path program 1 times [2018-10-15 13:08:44,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:44,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:08:44,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 13:08:44,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:08:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:08:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:08:44,400 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 7 states. [2018-10-15 13:08:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:44,631 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-10-15 13:08:44,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:08:44,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-10-15 13:08:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:44,633 INFO L225 Difference]: With dead ends: 57 [2018-10-15 13:08:44,633 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 13:08:44,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:08:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 13:08:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-10-15 13:08:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 13:08:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-15 13:08:44,642 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2018-10-15 13:08:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:44,643 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-15 13:08:44,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:08:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-15 13:08:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 13:08:44,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:44,646 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:44,647 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:44,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1411149363, now seen corresponding path program 1 times [2018-10-15 13:08:44,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:44,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:44,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:08:44,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:08:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:08:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:08:44,958 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 11 states. [2018-10-15 13:08:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:45,750 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-15 13:08:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:08:45,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-10-15 13:08:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:45,754 INFO L225 Difference]: With dead ends: 65 [2018-10-15 13:08:45,754 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 13:08:45,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:08:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 13:08:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-10-15 13:08:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 13:08:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-10-15 13:08:45,763 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 42 [2018-10-15 13:08:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:45,764 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-10-15 13:08:45,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:08:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-10-15 13:08:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 13:08:45,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:45,766 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:45,767 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:45,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:45,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1071125068, now seen corresponding path program 2 times [2018-10-15 13:08:45,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:45,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:45,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:08:45,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:08:45,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:08:45,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:08:45,979 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 12 states. [2018-10-15 13:08:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:46,400 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-10-15 13:08:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:08:46,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-10-15 13:08:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:46,402 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:08:46,402 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 13:08:46,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:08:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 13:08:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-10-15 13:08:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:08:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-10-15 13:08:46,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 49 [2018-10-15 13:08:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:46,421 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-10-15 13:08:46,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:08:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-10-15 13:08:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:08:46,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:46,426 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:46,427 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:46,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash -498780366, now seen corresponding path program 3 times [2018-10-15 13:08:46,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:46,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:46,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:08:46,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:08:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:08:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:08:46,890 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 15 states. [2018-10-15 13:08:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:47,728 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-10-15 13:08:47,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:08:47,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-10-15 13:08:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:47,731 INFO L225 Difference]: With dead ends: 94 [2018-10-15 13:08:47,731 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 13:08:47,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:08:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 13:08:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-15 13:08:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 13:08:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-10-15 13:08:47,739 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 60 [2018-10-15 13:08:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:47,739 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-10-15 13:08:47,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:08:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-10-15 13:08:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 13:08:47,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:47,741 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:47,741 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:47,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:47,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1316788469, now seen corresponding path program 4 times [2018-10-15 13:08:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:08:47,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:08:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:08:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:08:47,986 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2018-10-15 13:08:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:48,707 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-10-15 13:08:48,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:08:48,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-10-15 13:08:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:48,709 INFO L225 Difference]: With dead ends: 92 [2018-10-15 13:08:48,710 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 13:08:48,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:08:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 13:08:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-10-15 13:08:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 13:08:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-15 13:08:48,718 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 67 [2018-10-15 13:08:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:48,719 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-15 13:08:48,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:08:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-15 13:08:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 13:08:48,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:48,721 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:48,721 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:48,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1334297875, now seen corresponding path program 5 times [2018-10-15 13:08:48,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:49,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:49,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:08:49,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:08:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:08:49,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:08:49,063 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 19 states. [2018-10-15 13:08:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:49,904 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-10-15 13:08:49,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:08:49,905 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-10-15 13:08:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:49,906 INFO L225 Difference]: With dead ends: 123 [2018-10-15 13:08:49,906 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 13:08:49,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:08:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 13:08:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-10-15 13:08:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 13:08:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-10-15 13:08:49,915 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 78 [2018-10-15 13:08:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:49,915 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-10-15 13:08:49,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:08:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-10-15 13:08:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 13:08:49,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:49,918 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:49,918 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:49,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1465577300, now seen corresponding path program 6 times [2018-10-15 13:08:49,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 46 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:50,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:50,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:08:50,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:08:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:08:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:08:50,205 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 18 states. [2018-10-15 13:08:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:50,969 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-10-15 13:08:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:08:50,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 85 [2018-10-15 13:08:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:50,974 INFO L225 Difference]: With dead ends: 110 [2018-10-15 13:08:50,974 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 13:08:50,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:08:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 13:08:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2018-10-15 13:08:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 13:08:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-10-15 13:08:50,982 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 85 [2018-10-15 13:08:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:50,983 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-15 13:08:50,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:08:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-10-15 13:08:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 13:08:50,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:50,985 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:50,985 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:50,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1722514642, now seen corresponding path program 7 times [2018-10-15 13:08:50,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 86 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:51,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:51,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:08:51,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:08:51,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:08:51,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:08:51,294 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 23 states. [2018-10-15 13:08:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:52,183 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-10-15 13:08:52,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:08:52,185 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2018-10-15 13:08:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:52,187 INFO L225 Difference]: With dead ends: 152 [2018-10-15 13:08:52,187 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 13:08:52,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=511, Invalid=2039, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:08:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 13:08:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-15 13:08:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 13:08:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-10-15 13:08:52,194 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 96 [2018-10-15 13:08:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:52,194 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-10-15 13:08:52,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:08:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-10-15 13:08:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 13:08:52,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:52,196 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:52,196 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:52,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1744860203, now seen corresponding path program 8 times [2018-10-15 13:08:52,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 75 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:52,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:52,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:08:52,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:08:52,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:08:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:08:52,458 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2018-10-15 13:08:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:53,129 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2018-10-15 13:08:53,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:08:53,130 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2018-10-15 13:08:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:53,132 INFO L225 Difference]: With dead ends: 128 [2018-10-15 13:08:53,132 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 13:08:53,133 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 13:08:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 13:08:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2018-10-15 13:08:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 13:08:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-15 13:08:53,138 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 103 [2018-10-15 13:08:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:53,139 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-15 13:08:53,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:08:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-15 13:08:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 13:08:53,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:53,141 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:53,141 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:53,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1803205645, now seen corresponding path program 9 times [2018-10-15 13:08:53,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 135 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:53,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:53,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:08:53,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:08:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:08:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:08:53,861 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 27 states. [2018-10-15 13:08:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:55,036 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-10-15 13:08:55,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:08:55,036 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2018-10-15 13:08:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:55,038 INFO L225 Difference]: With dead ends: 181 [2018-10-15 13:08:55,038 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:08:55,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=699, Invalid=2961, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:08:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:08:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-15 13:08:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 13:08:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-10-15 13:08:55,044 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 114 [2018-10-15 13:08:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:55,044 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-10-15 13:08:55,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:08:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-10-15 13:08:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 13:08:55,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:55,046 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:55,046 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:55,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1298560780, now seen corresponding path program 10 times [2018-10-15 13:08:55,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 111 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:55,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:55,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 13:08:55,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 13:08:55,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 13:08:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:08:55,408 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 24 states. [2018-10-15 13:08:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:56,438 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2018-10-15 13:08:56,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:08:56,438 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 121 [2018-10-15 13:08:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:56,440 INFO L225 Difference]: With dead ends: 146 [2018-10-15 13:08:56,440 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 13:08:56,442 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 13:08:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 13:08:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-10-15 13:08:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 13:08:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-10-15 13:08:56,446 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 121 [2018-10-15 13:08:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:56,446 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-10-15 13:08:56,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 13:08:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-10-15 13:08:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 13:08:56,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:56,448 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:56,449 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:56,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1714660750, now seen corresponding path program 11 times [2018-10-15 13:08:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 195 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:56,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:56,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:08:56,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:08:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:08:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:08:56,905 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-10-15 13:08:57,541 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 13:08:58,821 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-15 13:08:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:59,099 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2018-10-15 13:08:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:08:59,099 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 132 [2018-10-15 13:08:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:59,100 INFO L225 Difference]: With dead ends: 210 [2018-10-15 13:08:59,101 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 13:08:59,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=915, Invalid=4055, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:08:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 13:08:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-15 13:08:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 13:08:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 13:08:59,105 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 132 [2018-10-15 13:08:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:59,106 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 13:08:59,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:08:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 13:08:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:08:59,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:59,107 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:59,108 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:59,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:59,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1133140299, now seen corresponding path program 12 times [2018-10-15 13:08:59,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 154 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:00,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:00,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:09:00,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:09:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:09:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:09:00,170 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 27 states. [2018-10-15 13:09:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:01,911 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2018-10-15 13:09:01,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:09:01,911 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 139 [2018-10-15 13:09:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:01,912 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:09:01,912 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 13:09:01,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:09:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 13:09:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2018-10-15 13:09:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:09:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-10-15 13:09:01,917 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 139 [2018-10-15 13:09:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:01,918 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-10-15 13:09:01,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:09:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-10-15 13:09:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:09:01,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:01,919 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:01,919 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:01,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:01,920 INFO L82 PathProgramCache]: Analyzing trace with hash 947841747, now seen corresponding path program 13 times [2018-10-15 13:09:01,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 266 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:02,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:02,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:09:02,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:09:02,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:09:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:09:02,415 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 35 states. [2018-10-15 13:09:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:03,919 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-10-15 13:09:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:09:03,919 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 150 [2018-10-15 13:09:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:03,922 INFO L225 Difference]: With dead ends: 239 [2018-10-15 13:09:03,922 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 13:09:03,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1159, Invalid=5321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:09:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 13:09:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-15 13:09:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 13:09:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-10-15 13:09:03,928 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 150 [2018-10-15 13:09:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:03,928 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-10-15 13:09:03,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:09:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-10-15 13:09:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:09:03,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:03,929 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:03,929 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:03,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash 795231596, now seen corresponding path program 14 times [2018-10-15 13:09:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 204 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:04,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:04,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:09:04,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:09:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:09:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:09:04,333 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 30 states. [2018-10-15 13:09:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:05,325 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-10-15 13:09:05,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:09:05,326 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 157 [2018-10-15 13:09:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:05,328 INFO L225 Difference]: With dead ends: 182 [2018-10-15 13:09:05,328 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 13:09:05,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:09:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 13:09:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-10-15 13:09:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 13:09:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-10-15 13:09:05,334 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 157 [2018-10-15 13:09:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:05,334 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-10-15 13:09:05,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:09:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-10-15 13:09:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 13:09:05,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:05,336 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:05,336 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:05,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:05,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1474441198, now seen corresponding path program 15 times [2018-10-15 13:09:05,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 348 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:06,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:06,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:09:06,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:09:06,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:09:06,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:09:06,550 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 39 states. [2018-10-15 13:09:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:08,237 INFO L93 Difference]: Finished difference Result 268 states and 269 transitions. [2018-10-15 13:09:08,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:09:08,238 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 168 [2018-10-15 13:09:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:08,239 INFO L225 Difference]: With dead ends: 268 [2018-10-15 13:09:08,240 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 13:09:08,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1431, Invalid=6759, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:09:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 13:09:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-15 13:09:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 13:09:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-10-15 13:09:08,246 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 168 [2018-10-15 13:09:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:08,247 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-10-15 13:09:08,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:09:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-10-15 13:09:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:09:08,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:08,248 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:08,248 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:08,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash 611784299, now seen corresponding path program 16 times [2018-10-15 13:09:08,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 261 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:09,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:09,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:09:09,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:09:09,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:09:09,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:09:09,183 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 33 states. [2018-10-15 13:09:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:10,340 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2018-10-15 13:09:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:09:10,341 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 175 [2018-10-15 13:09:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:10,342 INFO L225 Difference]: With dead ends: 200 [2018-10-15 13:09:10,343 INFO L226 Difference]: Without dead ends: 200 [2018-10-15 13:09:10,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:09:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-15 13:09:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2018-10-15 13:09:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 13:09:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-15 13:09:10,349 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 175 [2018-10-15 13:09:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:10,349 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-15 13:09:10,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:09:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-15 13:09:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 13:09:10,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:10,350 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:10,350 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:10,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:10,351 INFO L82 PathProgramCache]: Analyzing trace with hash -379668045, now seen corresponding path program 17 times [2018-10-15 13:09:10,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 441 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:09:11,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:09:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:09:11,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1561, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:09:11,460 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 43 states. [2018-10-15 13:09:13,230 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-15 13:09:13,704 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-15 13:09:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:15,275 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-10-15 13:09:15,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:09:15,276 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 186 [2018-10-15 13:09:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:15,277 INFO L225 Difference]: With dead ends: 297 [2018-10-15 13:09:15,278 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 13:09:15,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1731, Invalid=8369, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:09:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 13:09:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-15 13:09:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 13:09:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-10-15 13:09:15,283 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 186 [2018-10-15 13:09:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:15,283 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-10-15 13:09:15,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:09:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-10-15 13:09:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:09:15,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:15,285 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:15,285 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:15,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:15,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2020506572, now seen corresponding path program 18 times [2018-10-15 13:09:15,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 325 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:16,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:16,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 13:09:16,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 13:09:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 13:09:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:09:16,490 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 36 states. [2018-10-15 13:09:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:17,770 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2018-10-15 13:09:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:09:17,771 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 193 [2018-10-15 13:09:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:17,773 INFO L225 Difference]: With dead ends: 218 [2018-10-15 13:09:17,773 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 13:09:17,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:09:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 13:09:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2018-10-15 13:09:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 13:09:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-10-15 13:09:17,777 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 193 [2018-10-15 13:09:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:17,778 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-10-15 13:09:17,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 13:09:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-10-15 13:09:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 13:09:17,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:17,779 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:17,779 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:17,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:17,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1167449522, now seen corresponding path program 19 times [2018-10-15 13:09:17,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 545 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:18,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:18,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:09:18,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:09:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:09:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:09:18,807 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 47 states. [2018-10-15 13:09:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:21,714 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 13:09:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:09:21,714 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 204 [2018-10-15 13:09:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:21,715 INFO L225 Difference]: With dead ends: 326 [2018-10-15 13:09:21,715 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 13:09:21,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2059, Invalid=10151, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:09:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 13:09:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-15 13:09:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-15 13:09:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-10-15 13:09:21,721 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 204 [2018-10-15 13:09:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:21,721 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-10-15 13:09:21,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:09:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-10-15 13:09:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-15 13:09:21,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:21,723 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:21,723 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:21,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash 43821963, now seen corresponding path program 20 times [2018-10-15 13:09:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 396 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:22,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:22,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:09:22,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:09:22,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:09:22,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:09:22,936 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 39 states. [2018-10-15 13:09:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:24,915 INFO L93 Difference]: Finished difference Result 236 states and 237 transitions. [2018-10-15 13:09:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:09:24,916 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 211 [2018-10-15 13:09:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:24,919 INFO L225 Difference]: With dead ends: 236 [2018-10-15 13:09:24,919 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 13:09:24,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 13:09:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 13:09:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2018-10-15 13:09:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 13:09:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-10-15 13:09:24,925 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 211 [2018-10-15 13:09:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:24,925 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-10-15 13:09:24,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:09:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-10-15 13:09:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 13:09:24,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:24,927 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:24,927 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:24,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1920028525, now seen corresponding path program 21 times [2018-10-15 13:09:24,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 660 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:26,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:26,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:09:26,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:09:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:09:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:09:26,341 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 51 states. [2018-10-15 13:09:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:29,352 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-10-15 13:09:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:09:29,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 222 [2018-10-15 13:09:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:29,354 INFO L225 Difference]: With dead ends: 355 [2018-10-15 13:09:29,354 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 13:09:29,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3858 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2415, Invalid=12105, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:09:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 13:09:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-15 13:09:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 13:09:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-10-15 13:09:29,360 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 222 [2018-10-15 13:09:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:29,360 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-10-15 13:09:29,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:09:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-10-15 13:09:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 13:09:29,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:29,362 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:29,362 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:29,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash 449387052, now seen corresponding path program 22 times [2018-10-15 13:09:29,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 474 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:30,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:30,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:09:30,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:09:30,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:09:30,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:09:30,974 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 42 states. [2018-10-15 13:09:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:32,878 INFO L93 Difference]: Finished difference Result 254 states and 255 transitions. [2018-10-15 13:09:32,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:09:32,878 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 229 [2018-10-15 13:09:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:32,881 INFO L225 Difference]: With dead ends: 254 [2018-10-15 13:09:32,881 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 13:09:32,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:09:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 13:09:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2018-10-15 13:09:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 13:09:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-10-15 13:09:32,888 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 229 [2018-10-15 13:09:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:32,888 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-10-15 13:09:32,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:09:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-10-15 13:09:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 13:09:32,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:32,890 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:32,891 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:32,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash 229278546, now seen corresponding path program 23 times [2018-10-15 13:09:32,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 786 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:33,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:33,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:09:33,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:09:33,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:09:33,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2575, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:09:33,951 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 55 states. [2018-10-15 13:09:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:37,121 INFO L93 Difference]: Finished difference Result 384 states and 385 transitions. [2018-10-15 13:09:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:09:37,121 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 240 [2018-10-15 13:09:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:37,123 INFO L225 Difference]: With dead ends: 384 [2018-10-15 13:09:37,123 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 13:09:37,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4587 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2799, Invalid=14231, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:09:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 13:09:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-15 13:09:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:09:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-10-15 13:09:37,128 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 240 [2018-10-15 13:09:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:37,128 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-10-15 13:09:37,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:09:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-10-15 13:09:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 13:09:37,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:37,130 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:37,130 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:37,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1297160363, now seen corresponding path program 24 times [2018-10-15 13:09:37,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 559 proven. 786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:37,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:37,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:09:37,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:09:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:09:37,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:09:37,946 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 45 states. [2018-10-15 13:09:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:39,920 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-10-15 13:09:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 13:09:39,920 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 247 [2018-10-15 13:09:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:39,922 INFO L225 Difference]: With dead ends: 272 [2018-10-15 13:09:39,922 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 13:09:39,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:09:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 13:09:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2018-10-15 13:09:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 13:09:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-15 13:09:39,927 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 247 [2018-10-15 13:09:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:39,927 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-15 13:09:39,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:09:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-15 13:09:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 13:09:39,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:39,929 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:39,929 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:39,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:39,930 INFO L82 PathProgramCache]: Analyzing trace with hash -470233229, now seen corresponding path program 25 times [2018-10-15 13:09:39,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 923 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:41,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:41,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:09:41,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:09:41,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:09:41,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2969, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:09:41,238 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 59 states. [2018-10-15 13:09:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:45,129 INFO L93 Difference]: Finished difference Result 413 states and 414 transitions. [2018-10-15 13:09:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:09:45,130 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 258 [2018-10-15 13:09:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:45,131 INFO L225 Difference]: With dead ends: 413 [2018-10-15 13:09:45,131 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 13:09:45,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5379 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3211, Invalid=16529, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:09:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 13:09:45,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-15 13:09:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:09:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2018-10-15 13:09:45,135 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 258 [2018-10-15 13:09:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:45,136 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2018-10-15 13:09:45,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:09:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2018-10-15 13:09:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 13:09:45,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:45,137 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:45,138 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:45,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:45,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1900028044, now seen corresponding path program 26 times [2018-10-15 13:09:45,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 651 proven. 923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:46,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:46,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:09:46,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:09:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:09:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:09:46,415 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 48 states. [2018-10-15 13:09:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:48,862 INFO L93 Difference]: Finished difference Result 290 states and 291 transitions. [2018-10-15 13:09:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:09:48,863 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 265 [2018-10-15 13:09:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:48,865 INFO L225 Difference]: With dead ends: 290 [2018-10-15 13:09:48,865 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 13:09:48,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:09:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 13:09:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2018-10-15 13:09:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 13:09:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-10-15 13:09:48,870 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 265 [2018-10-15 13:09:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:48,871 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-10-15 13:09:48,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:09:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-10-15 13:09:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 13:09:48,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:48,872 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:48,872 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:48,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:48,873 INFO L82 PathProgramCache]: Analyzing trace with hash -481181454, now seen corresponding path program 27 times [2018-10-15 13:09:48,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 1071 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:50,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:50,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:09:50,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:09:50,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:09:50,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3391, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:09:50,238 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 63 states. [2018-10-15 13:09:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:54,238 INFO L93 Difference]: Finished difference Result 442 states and 443 transitions. [2018-10-15 13:09:54,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:09:54,238 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 276 [2018-10-15 13:09:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:54,239 INFO L225 Difference]: With dead ends: 442 [2018-10-15 13:09:54,240 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 13:09:54,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6234 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3651, Invalid=18999, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:09:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 13:09:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-15 13:09:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:09:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 285 transitions. [2018-10-15 13:09:54,245 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 285 transitions. Word has length 276 [2018-10-15 13:09:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:54,245 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 285 transitions. [2018-10-15 13:09:54,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:09:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 285 transitions. [2018-10-15 13:09:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-15 13:09:54,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:54,247 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:54,248 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:54,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1265262027, now seen corresponding path program 28 times [2018-10-15 13:09:54,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 750 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:55,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:55,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:09:55,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:09:55,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:09:55,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:09:55,697 INFO L87 Difference]: Start difference. First operand 284 states and 285 transitions. Second operand 51 states. [2018-10-15 13:09:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:58,344 INFO L93 Difference]: Finished difference Result 308 states and 309 transitions. [2018-10-15 13:09:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:09:58,345 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 283 [2018-10-15 13:09:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:58,346 INFO L225 Difference]: With dead ends: 308 [2018-10-15 13:09:58,347 INFO L226 Difference]: Without dead ends: 308 [2018-10-15 13:09:58,349 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 13:09:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-15 13:09:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2018-10-15 13:09:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 13:09:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-15 13:09:58,352 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 283 [2018-10-15 13:09:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:58,352 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-15 13:09:58,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:09:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-15 13:09:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 13:09:58,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:58,354 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:58,354 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:58,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 604444243, now seen corresponding path program 29 times [2018-10-15 13:09:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 1230 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:00,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:00,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:10:00,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:10:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:10:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:10:00,537 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 67 states. [2018-10-15 13:10:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:04,996 INFO L93 Difference]: Finished difference Result 471 states and 472 transitions. [2018-10-15 13:10:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 13:10:04,996 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 294 [2018-10-15 13:10:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:04,997 INFO L225 Difference]: With dead ends: 471 [2018-10-15 13:10:04,997 INFO L226 Difference]: Without dead ends: 304 [2018-10-15 13:10:04,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7152 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4119, Invalid=21641, Unknown=0, NotChecked=0, Total=25760 [2018-10-15 13:10:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-15 13:10:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-15 13:10:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:10:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2018-10-15 13:10:05,003 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 294 [2018-10-15 13:10:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:05,003 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2018-10-15 13:10:05,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:10:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2018-10-15 13:10:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 13:10:05,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:05,005 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:05,005 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:05,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash -551710996, now seen corresponding path program 30 times [2018-10-15 13:10:05,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2086 backedges. 856 proven. 1230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:06,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:06,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 13:10:06,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 13:10:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 13:10:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:10:06,062 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 54 states. [2018-10-15 13:10:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:09,024 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 13:10:09,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 13:10:09,024 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 301 [2018-10-15 13:10:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:09,027 INFO L225 Difference]: With dead ends: 326 [2018-10-15 13:10:09,027 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 13:10:09,028 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 13:10:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 13:10:09,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2018-10-15 13:10:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 13:10:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-10-15 13:10:09,032 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 301 [2018-10-15 13:10:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:09,033 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-10-15 13:10:09,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 13:10:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-10-15 13:10:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 13:10:09,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:09,035 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:09,035 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:09,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1359058578, now seen corresponding path program 31 times [2018-10-15 13:10:09,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 1400 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:10,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:10,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:10:10,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:10:10,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:10:10,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=4319, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:10:10,798 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 71 states. [2018-10-15 13:10:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:15,761 INFO L93 Difference]: Finished difference Result 500 states and 501 transitions. [2018-10-15 13:10:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 13:10:15,762 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 312 [2018-10-15 13:10:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:15,763 INFO L225 Difference]: With dead ends: 500 [2018-10-15 13:10:15,763 INFO L226 Difference]: Without dead ends: 322 [2018-10-15 13:10:15,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8133 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4615, Invalid=24455, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:10:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-15 13:10:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-15 13:10:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 13:10:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2018-10-15 13:10:15,768 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 312 [2018-10-15 13:10:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:15,769 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2018-10-15 13:10:15,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:10:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2018-10-15 13:10:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 13:10:15,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:15,771 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:15,771 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:15,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2067692267, now seen corresponding path program 32 times [2018-10-15 13:10:15,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 969 proven. 1400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:17,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:17,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:10:17,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:10:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:10:17,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:10:17,128 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 57 states. [2018-10-15 13:10:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:20,374 INFO L93 Difference]: Finished difference Result 344 states and 345 transitions. [2018-10-15 13:10:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 13:10:20,375 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 319 [2018-10-15 13:10:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:20,377 INFO L225 Difference]: With dead ends: 344 [2018-10-15 13:10:20,378 INFO L226 Difference]: Without dead ends: 344 [2018-10-15 13:10:20,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 13:10:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-15 13:10:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2018-10-15 13:10:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 13:10:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-10-15 13:10:20,384 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 319 [2018-10-15 13:10:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:20,384 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-10-15 13:10:20,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:10:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-10-15 13:10:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 13:10:20,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:20,386 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:20,386 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:20,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1650227917, now seen corresponding path program 33 times [2018-10-15 13:10:20,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1581 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:22,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:22,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:10:22,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:10:22,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:10:22,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=4825, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:10:22,334 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 75 states. [2018-10-15 13:10:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:27,877 INFO L93 Difference]: Finished difference Result 529 states and 530 transitions. [2018-10-15 13:10:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 13:10:27,877 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 330 [2018-10-15 13:10:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:27,879 INFO L225 Difference]: With dead ends: 529 [2018-10-15 13:10:27,879 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 13:10:27,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9177 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5139, Invalid=27441, Unknown=0, NotChecked=0, Total=32580 [2018-10-15 13:10:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 13:10:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2018-10-15 13:10:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-15 13:10:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 339 transitions. [2018-10-15 13:10:27,884 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 339 transitions. Word has length 330 [2018-10-15 13:10:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:27,885 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 339 transitions. [2018-10-15 13:10:27,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:10:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 339 transitions. [2018-10-15 13:10:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-15 13:10:27,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:27,887 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:27,887 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:27,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1881892172, now seen corresponding path program 34 times [2018-10-15 13:10:27,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 1089 proven. 1581 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:29,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:29,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 13:10:29,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 13:10:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 13:10:29,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:10:29,120 INFO L87 Difference]: Start difference. First operand 338 states and 339 transitions. Second operand 60 states. [2018-10-15 13:10:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:32,418 INFO L93 Difference]: Finished difference Result 362 states and 363 transitions. [2018-10-15 13:10:32,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:10:32,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 337 [2018-10-15 13:10:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:32,420 INFO L225 Difference]: With dead ends: 362 [2018-10-15 13:10:32,420 INFO L226 Difference]: Without dead ends: 362 [2018-10-15 13:10:32,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:10:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-15 13:10:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 349. [2018-10-15 13:10:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 13:10:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-10-15 13:10:32,427 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 337 [2018-10-15 13:10:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:32,427 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-10-15 13:10:32,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 13:10:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-10-15 13:10:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 13:10:32,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:32,430 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:32,430 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:32,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash -391117774, now seen corresponding path program 35 times [2018-10-15 13:10:32,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 1773 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:35,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:35,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:10:35,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:10:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:10:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=5359, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:10:35,365 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 79 states. [2018-10-15 13:10:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:41,331 INFO L93 Difference]: Finished difference Result 558 states and 559 transitions. [2018-10-15 13:10:41,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 13:10:41,331 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 348 [2018-10-15 13:10:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:41,333 INFO L225 Difference]: With dead ends: 558 [2018-10-15 13:10:41,333 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 13:10:41,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10284 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5691, Invalid=30599, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 13:10:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 13:10:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-10-15 13:10:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 13:10:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-10-15 13:10:41,338 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 348 [2018-10-15 13:10:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:41,338 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-10-15 13:10:41,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:10:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-10-15 13:10:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-15 13:10:41,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:41,341 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:41,341 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:41,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash -224169973, now seen corresponding path program 36 times [2018-10-15 13:10:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2989 backedges. 1216 proven. 1773 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:42,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:42,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:10:42,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:10:42,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:10:42,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:10:42,584 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 63 states. [2018-10-15 13:10:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:46,517 INFO L93 Difference]: Finished difference Result 380 states and 381 transitions. [2018-10-15 13:10:46,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 13:10:46,517 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 355 [2018-10-15 13:10:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:46,519 INFO L225 Difference]: With dead ends: 380 [2018-10-15 13:10:46,520 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 13:10:46,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 13:10:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 13:10:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 367. [2018-10-15 13:10:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-15 13:10:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-10-15 13:10:46,525 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 355 [2018-10-15 13:10:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:46,525 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-10-15 13:10:46,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:10:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-10-15 13:10:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 13:10:46,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:46,528 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:46,528 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:46,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1496849427, now seen corresponding path program 37 times [2018-10-15 13:10:46,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 1976 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:49,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:49,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:10:49,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:10:49,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:10:49,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=5921, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:10:49,016 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 83 states. [2018-10-15 13:10:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:55,757 INFO L93 Difference]: Finished difference Result 587 states and 588 transitions. [2018-10-15 13:10:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 13:10:55,758 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 366 [2018-10-15 13:10:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:55,759 INFO L225 Difference]: With dead ends: 587 [2018-10-15 13:10:55,759 INFO L226 Difference]: Without dead ends: 376 [2018-10-15 13:10:55,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11454 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6271, Invalid=33929, Unknown=0, NotChecked=0, Total=40200 [2018-10-15 13:10:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-15 13:10:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2018-10-15 13:10:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:10:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 375 transitions. [2018-10-15 13:10:55,765 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 375 transitions. Word has length 366 [2018-10-15 13:10:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:55,765 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 375 transitions. [2018-10-15 13:10:55,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:10:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 375 transitions. [2018-10-15 13:10:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 13:10:55,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:55,767 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:55,768 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:55,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2025038764, now seen corresponding path program 38 times [2018-10-15 13:10:55,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3326 backedges. 1350 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:57,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:57,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 13:10:57,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 13:10:57,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 13:10:57,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:10:57,140 INFO L87 Difference]: Start difference. First operand 374 states and 375 transitions. Second operand 66 states. [2018-10-15 13:11:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:01,089 INFO L93 Difference]: Finished difference Result 398 states and 399 transitions. [2018-10-15 13:11:01,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 13:11:01,089 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 373 [2018-10-15 13:11:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:01,092 INFO L225 Difference]: With dead ends: 398 [2018-10-15 13:11:01,092 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 13:11:01,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11073 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6189, Invalid=27851, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 13:11:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 13:11:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 385. [2018-10-15 13:11:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 13:11:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-10-15 13:11:01,097 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 373 [2018-10-15 13:11:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:01,097 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-10-15 13:11:01,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 13:11:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-10-15 13:11:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-15 13:11:01,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:01,099 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:01,099 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:01,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1546450478, now seen corresponding path program 39 times [2018-10-15 13:11:01,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 2190 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:03,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:03,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:11:03,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:11:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:11:03,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=971, Invalid=6511, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:11:03,565 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 87 states. [2018-10-15 13:11:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:10,816 INFO L93 Difference]: Finished difference Result 616 states and 617 transitions. [2018-10-15 13:11:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 13:11:10,816 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 384 [2018-10-15 13:11:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:10,818 INFO L225 Difference]: With dead ends: 616 [2018-10-15 13:11:10,818 INFO L226 Difference]: Without dead ends: 394 [2018-10-15 13:11:10,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12687 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6879, Invalid=37431, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 13:11:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-15 13:11:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2018-10-15 13:11:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:11:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2018-10-15 13:11:10,824 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 384 [2018-10-15 13:11:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:10,824 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2018-10-15 13:11:10,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:11:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2018-10-15 13:11:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-15 13:11:10,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:10,827 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:10,827 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:10,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1091617493, now seen corresponding path program 40 times [2018-10-15 13:11:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 1491 proven. 2190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:12,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:11:12,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:11:12,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:11:12,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:11:12,269 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 69 states. [2018-10-15 13:11:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:16,500 INFO L93 Difference]: Finished difference Result 416 states and 417 transitions. [2018-10-15 13:11:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 13:11:16,501 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 391 [2018-10-15 13:11:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:16,503 INFO L225 Difference]: With dead ends: 416 [2018-10-15 13:11:16,503 INFO L226 Difference]: Without dead ends: 416 [2018-10-15 13:11:16,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 13:11:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-15 13:11:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 403. [2018-10-15 13:11:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 13:11:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-10-15 13:11:16,510 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 391 [2018-10-15 13:11:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:16,511 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-10-15 13:11:16,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:11:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-10-15 13:11:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 13:11:16,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:16,513 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:16,513 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:16,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1213277453, now seen corresponding path program 41 times [2018-10-15 13:11:16,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 2415 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:19,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:19,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:11:19,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:11:19,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:11:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1061, Invalid=7129, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:11:19,557 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 91 states. [2018-10-15 13:11:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:27,499 INFO L93 Difference]: Finished difference Result 645 states and 646 transitions. [2018-10-15 13:11:27,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 13:11:27,499 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 402 [2018-10-15 13:11:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:27,501 INFO L225 Difference]: With dead ends: 645 [2018-10-15 13:11:27,501 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 13:11:27,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13983 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=7515, Invalid=41105, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 13:11:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 13:11:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2018-10-15 13:11:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:11:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-10-15 13:11:27,507 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 402 [2018-10-15 13:11:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:27,507 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-10-15 13:11:27,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:11:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-10-15 13:11:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 13:11:27,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:27,510 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:27,510 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:27,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:27,510 INFO L82 PathProgramCache]: Analyzing trace with hash 897600012, now seen corresponding path program 42 times [2018-10-15 13:11:27,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 1639 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:29,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:29,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 13:11:29,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 13:11:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 13:11:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:11:29,270 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 72 states. [2018-10-15 13:11:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:33,998 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 13:11:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 13:11:33,999 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 409 [2018-10-15 13:11:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:34,000 INFO L225 Difference]: With dead ends: 434 [2018-10-15 13:11:34,001 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 13:11:34,003 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 13:11:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 13:11:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 421. [2018-10-15 13:11:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-15 13:11:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-10-15 13:11:34,008 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 409 [2018-10-15 13:11:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:34,008 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-10-15 13:11:34,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 13:11:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-10-15 13:11:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-15 13:11:34,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:34,011 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:34,011 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:34,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1130407794, now seen corresponding path program 43 times [2018-10-15 13:11:34,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 2651 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:37,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:37,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:11:37,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:11:37,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:11:37,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=7775, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:11:37,064 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 95 states. [2018-10-15 13:11:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:44,217 INFO L93 Difference]: Finished difference Result 674 states and 675 transitions. [2018-10-15 13:11:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 13:11:44,217 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 420 [2018-10-15 13:11:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:44,218 INFO L225 Difference]: With dead ends: 674 [2018-10-15 13:11:44,218 INFO L226 Difference]: Without dead ends: 430 [2018-10-15 13:11:44,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15342 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=8179, Invalid=44951, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 13:11:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-15 13:11:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2018-10-15 13:11:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:11:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 429 transitions. [2018-10-15 13:11:44,223 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 429 transitions. Word has length 420 [2018-10-15 13:11:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:44,223 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 429 transitions. [2018-10-15 13:11:44,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:11:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 429 transitions. [2018-10-15 13:11:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-15 13:11:44,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:44,225 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:44,225 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:44,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1157096011, now seen corresponding path program 44 times [2018-10-15 13:11:44,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 1794 proven. 2651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:46,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:46,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:11:46,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:11:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:11:46,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:11:46,376 INFO L87 Difference]: Start difference. First operand 428 states and 429 transitions. Second operand 75 states. [2018-10-15 13:11:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:52,061 INFO L93 Difference]: Finished difference Result 452 states and 453 transitions. [2018-10-15 13:11:52,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 13:11:52,062 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 427 [2018-10-15 13:11:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:52,064 INFO L225 Difference]: With dead ends: 452 [2018-10-15 13:11:52,064 INFO L226 Difference]: Without dead ends: 452 [2018-10-15 13:11:52,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 13:11:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-10-15 13:11:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 439. [2018-10-15 13:11:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-15 13:11:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-10-15 13:11:52,071 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 427 [2018-10-15 13:11:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:52,071 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-10-15 13:11:52,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:11:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-10-15 13:11:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-15 13:11:52,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:52,074 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:52,074 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:52,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash 309445075, now seen corresponding path program 45 times [2018-10-15 13:11:52,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 2898 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:55,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:55,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:11:55,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:11:55,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:11:55,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1253, Invalid=8449, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:11:55,648 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 99 states. [2018-10-15 13:12:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:04,856 INFO L93 Difference]: Finished difference Result 703 states and 704 transitions. [2018-10-15 13:12:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 13:12:04,856 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 438 [2018-10-15 13:12:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:04,858 INFO L225 Difference]: With dead ends: 703 [2018-10-15 13:12:04,858 INFO L226 Difference]: Without dead ends: 448 [2018-10-15 13:12:04,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16764 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=8871, Invalid=48969, Unknown=0, NotChecked=0, Total=57840 [2018-10-15 13:12:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-15 13:12:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2018-10-15 13:12:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-15 13:12:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 447 transitions. [2018-10-15 13:12:04,863 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 447 transitions. Word has length 438 [2018-10-15 13:12:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:04,863 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 447 transitions. [2018-10-15 13:12:04,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:12:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 447 transitions. [2018-10-15 13:12:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-15 13:12:04,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:04,865 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:04,865 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:04,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:04,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1809537132, now seen corresponding path program 46 times [2018-10-15 13:12:04,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4854 backedges. 1956 proven. 2898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:07,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:07,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:12:07,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:12:07,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:12:07,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:12:07,063 INFO L87 Difference]: Start difference. First operand 446 states and 447 transitions. Second operand 78 states. [2018-10-15 13:12:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:13,810 INFO L93 Difference]: Finished difference Result 470 states and 471 transitions. [2018-10-15 13:12:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 13:12:13,810 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 445 [2018-10-15 13:12:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:13,812 INFO L225 Difference]: With dead ends: 470 [2018-10-15 13:12:13,812 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 13:12:13,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 13:12:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 13:12:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 457. [2018-10-15 13:12:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-15 13:12:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-10-15 13:12:13,818 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 445 [2018-10-15 13:12:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:13,818 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-10-15 13:12:13,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:12:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-10-15 13:12:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-15 13:12:13,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:13,820 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:13,820 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:13,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1345397486, now seen corresponding path program 47 times [2018-10-15 13:12:13,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 3156 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:18,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:18,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:12:18,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:12:18,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:12:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1355, Invalid=9151, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:12:18,104 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 103 states. [2018-10-15 13:12:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:28,117 INFO L93 Difference]: Finished difference Result 732 states and 733 transitions. [2018-10-15 13:12:28,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 13:12:28,117 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 456 [2018-10-15 13:12:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:28,119 INFO L225 Difference]: With dead ends: 732 [2018-10-15 13:12:28,119 INFO L226 Difference]: Without dead ends: 466 [2018-10-15 13:12:28,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18249 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=9591, Invalid=53159, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:12:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-10-15 13:12:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2018-10-15 13:12:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 13:12:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2018-10-15 13:12:28,129 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 456 [2018-10-15 13:12:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:28,130 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2018-10-15 13:12:28,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:12:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2018-10-15 13:12:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-15 13:12:28,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:28,132 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:28,133 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:28,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1592565909, now seen corresponding path program 48 times [2018-10-15 13:12:28,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5281 backedges. 2125 proven. 3156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:30,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:30,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:12:30,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:12:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:12:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:12:30,070 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 81 states. [2018-10-15 13:12:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:36,072 INFO L93 Difference]: Finished difference Result 488 states and 489 transitions. [2018-10-15 13:12:36,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 13:12:36,072 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 463 [2018-10-15 13:12:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:36,075 INFO L225 Difference]: With dead ends: 488 [2018-10-15 13:12:36,075 INFO L226 Difference]: Without dead ends: 488 [2018-10-15 13:12:36,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17343 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9484, Invalid=43186, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 13:12:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-15 13:12:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 475. [2018-10-15 13:12:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 13:12:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 476 transitions. [2018-10-15 13:12:36,082 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 476 transitions. Word has length 463 [2018-10-15 13:12:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:36,083 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 476 transitions. [2018-10-15 13:12:36,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:12:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 476 transitions. [2018-10-15 13:12:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-15 13:12:36,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:36,086 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:36,086 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:36,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1533726899, now seen corresponding path program 49 times [2018-10-15 13:12:36,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 3425 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:39,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:39,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 13:12:39,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 13:12:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 13:12:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1461, Invalid=9881, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:12:39,712 INFO L87 Difference]: Start difference. First operand 475 states and 476 transitions. Second operand 107 states. [2018-10-15 13:12:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:50,662 INFO L93 Difference]: Finished difference Result 761 states and 762 transitions. [2018-10-15 13:12:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 13:12:50,663 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 474 [2018-10-15 13:12:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:50,665 INFO L225 Difference]: With dead ends: 761 [2018-10-15 13:12:50,665 INFO L226 Difference]: Without dead ends: 484 [2018-10-15 13:12:50,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19797 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=10339, Invalid=57521, Unknown=0, NotChecked=0, Total=67860 [2018-10-15 13:12:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-15 13:12:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2018-10-15 13:12:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-15 13:12:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 483 transitions. [2018-10-15 13:12:50,670 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 483 transitions. Word has length 474 [2018-10-15 13:12:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:50,671 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 483 transitions. [2018-10-15 13:12:50,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 13:12:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 483 transitions. [2018-10-15 13:12:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-15 13:12:50,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:50,674 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:50,674 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:50,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 160353996, now seen corresponding path program 50 times [2018-10-15 13:12:50,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5726 backedges. 2301 proven. 3425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:53,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:53,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 13:12:53,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 13:12:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 13:12:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:12:53,043 INFO L87 Difference]: Start difference. First operand 482 states and 483 transitions. Second operand 84 states. [2018-10-15 13:12:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:59,462 INFO L93 Difference]: Finished difference Result 506 states and 507 transitions. [2018-10-15 13:12:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 13:12:59,462 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 481 [2018-10-15 13:12:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:59,465 INFO L225 Difference]: With dead ends: 506 [2018-10-15 13:12:59,465 INFO L226 Difference]: Without dead ends: 506 [2018-10-15 13:12:59,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18765 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10227, Invalid=46655, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:12:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-10-15 13:12:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 493. [2018-10-15 13:12:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-15 13:12:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 494 transitions. [2018-10-15 13:12:59,471 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 494 transitions. Word has length 481 [2018-10-15 13:12:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:59,471 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 494 transitions. [2018-10-15 13:12:59,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 13:12:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 494 transitions. [2018-10-15 13:12:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 13:12:59,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:59,473 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:59,474 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:59,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1494461106, now seen corresponding path program 51 times [2018-10-15 13:12:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 3705 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:03,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:03,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 13:13:03,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 13:13:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 13:13:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1571, Invalid=10639, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:13:03,527 INFO L87 Difference]: Start difference. First operand 493 states and 494 transitions. Second operand 111 states. [2018-10-15 13:13:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:17,783 INFO L93 Difference]: Finished difference Result 790 states and 791 transitions. [2018-10-15 13:13:17,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-15 13:13:17,783 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 492 [2018-10-15 13:13:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:17,786 INFO L225 Difference]: With dead ends: 790 [2018-10-15 13:13:17,786 INFO L226 Difference]: Without dead ends: 502 [2018-10-15 13:13:17,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21408 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=11115, Invalid=62055, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:13:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-10-15 13:13:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2018-10-15 13:13:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 13:13:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 501 transitions. [2018-10-15 13:13:17,791 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 501 transitions. Word has length 492 [2018-10-15 13:13:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:17,791 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 501 transitions. [2018-10-15 13:13:17,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 13:13:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 501 transitions. [2018-10-15 13:13:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 13:13:17,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:17,793 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:17,793 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:17,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 118994059, now seen corresponding path program 52 times [2018-10-15 13:13:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6189 backedges. 2484 proven. 3705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:19,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:19,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:13:19,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:13:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:13:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:13:19,974 INFO L87 Difference]: Start difference. First operand 500 states and 501 transitions. Second operand 87 states. [2018-10-15 13:13:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:26,942 INFO L93 Difference]: Finished difference Result 524 states and 525 transitions. [2018-10-15 13:13:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:13:26,943 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 499 [2018-10-15 13:13:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:26,945 INFO L225 Difference]: With dead ends: 524 [2018-10-15 13:13:26,945 INFO L226 Difference]: Without dead ends: 524 [2018-10-15 13:13:26,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20243 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10998, Invalid=50258, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 13:13:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-15 13:13:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 511. [2018-10-15 13:13:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-15 13:13:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-10-15 13:13:26,951 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 499 [2018-10-15 13:13:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:26,952 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-10-15 13:13:26,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:13:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-10-15 13:13:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-15 13:13:26,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:26,954 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:26,954 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:26,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1123809389, now seen corresponding path program 53 times [2018-10-15 13:13:26,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3996 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:31,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:31,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 13:13:31,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 13:13:31,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 13:13:31,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=11425, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:13:31,304 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 115 states. [2018-10-15 13:13:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:43,835 INFO L93 Difference]: Finished difference Result 819 states and 820 transitions. [2018-10-15 13:13:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-15 13:13:43,836 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 510 [2018-10-15 13:13:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:43,838 INFO L225 Difference]: With dead ends: 819 [2018-10-15 13:13:43,838 INFO L226 Difference]: Without dead ends: 520 [2018-10-15 13:13:43,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23082 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=11919, Invalid=66761, Unknown=0, NotChecked=0, Total=78680 [2018-10-15 13:13:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-15 13:13:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2018-10-15 13:13:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-15 13:13:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 519 transitions. [2018-10-15 13:13:43,844 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 519 transitions. Word has length 510 [2018-10-15 13:13:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:43,844 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 519 transitions. [2018-10-15 13:13:43,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 13:13:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 519 transitions. [2018-10-15 13:13:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-10-15 13:13:43,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:43,846 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:43,846 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:43,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -991646420, now seen corresponding path program 54 times [2018-10-15 13:13:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 2674 proven. 3996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:46,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:46,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 13:13:46,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 13:13:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 13:13:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:13:46,219 INFO L87 Difference]: Start difference. First operand 518 states and 519 transitions. Second operand 90 states. [2018-10-15 13:13:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:52,873 INFO L93 Difference]: Finished difference Result 542 states and 543 transitions. [2018-10-15 13:13:52,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 13:13:52,874 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 517 [2018-10-15 13:13:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:52,876 INFO L225 Difference]: With dead ends: 542 [2018-10-15 13:13:52,877 INFO L226 Difference]: Without dead ends: 542 [2018-10-15 13:13:52,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11797, Invalid=53995, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 13:13:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-15 13:13:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 529. [2018-10-15 13:13:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-15 13:13:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2018-10-15 13:13:52,883 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 517 [2018-10-15 13:13:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:52,884 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 530 transitions. [2018-10-15 13:13:52,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 13:13:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 530 transitions. [2018-10-15 13:13:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-15 13:13:52,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:52,886 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:52,886 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:52,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1767567278, now seen corresponding path program 55 times [2018-10-15 13:13:52,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 4298 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:57,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 13:13:57,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 13:13:57,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 13:13:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1803, Invalid=12239, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:13:57,332 INFO L87 Difference]: Start difference. First operand 529 states and 530 transitions. Second operand 119 states. [2018-10-15 13:14:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:10,704 INFO L93 Difference]: Finished difference Result 848 states and 849 transitions. [2018-10-15 13:14:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-15 13:14:10,704 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 528 [2018-10-15 13:14:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:10,706 INFO L225 Difference]: With dead ends: 848 [2018-10-15 13:14:10,706 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 13:14:10,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24819 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=12751, Invalid=71639, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:14:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 13:14:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2018-10-15 13:14:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-15 13:14:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2018-10-15 13:14:10,711 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 528 [2018-10-15 13:14:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:10,712 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2018-10-15 13:14:10,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:14:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2018-10-15 13:14:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-10-15 13:14:10,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:10,714 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:10,714 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:10,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash 576381355, now seen corresponding path program 56 times [2018-10-15 13:14:10,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7169 backedges. 2871 proven. 4298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:13,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:13,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:14:13,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:14:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:14:13,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:14:13,186 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 93 states. [2018-10-15 13:14:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:20,916 INFO L93 Difference]: Finished difference Result 560 states and 561 transitions. [2018-10-15 13:14:20,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 13:14:20,916 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 535 [2018-10-15 13:14:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:20,919 INFO L225 Difference]: With dead ends: 560 [2018-10-15 13:14:20,919 INFO L226 Difference]: Without dead ends: 560 [2018-10-15 13:14:20,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12624, Invalid=57866, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 13:14:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-15 13:14:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 547. [2018-10-15 13:14:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-15 13:14:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 548 transitions. [2018-10-15 13:14:20,927 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 548 transitions. Word has length 535 [2018-10-15 13:14:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:20,927 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 548 transitions. [2018-10-15 13:14:20,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:14:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 548 transitions. [2018-10-15 13:14:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-15 13:14:20,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:20,930 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:20,930 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:20,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash 975660659, now seen corresponding path program 57 times [2018-10-15 13:14:20,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 4611 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:25,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:25,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:14:25,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:14:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:14:25,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1925, Invalid=13081, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:14:25,862 INFO L87 Difference]: Start difference. First operand 547 states and 548 transitions. Second operand 123 states. [2018-10-15 13:14:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:36,301 INFO L93 Difference]: Finished difference Result 877 states and 878 transitions. [2018-10-15 13:14:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-15 13:14:36,301 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 546 [2018-10-15 13:14:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:36,303 INFO L225 Difference]: With dead ends: 877 [2018-10-15 13:14:36,303 INFO L226 Difference]: Without dead ends: 556 [2018-10-15 13:14:36,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26619 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=13611, Invalid=76689, Unknown=0, NotChecked=0, Total=90300 [2018-10-15 13:14:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-10-15 13:14:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2018-10-15 13:14:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-15 13:14:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2018-10-15 13:14:36,309 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 546 [2018-10-15 13:14:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:36,310 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2018-10-15 13:14:36,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:14:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2018-10-15 13:14:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-10-15 13:14:36,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:36,312 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:36,312 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:36,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1129909364, now seen corresponding path program 58 times [2018-10-15 13:14:36,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7686 backedges. 3075 proven. 4611 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:38,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:38,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 13:14:38,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 13:14:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 13:14:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 13:14:38,950 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 96 states. [2018-10-15 13:14:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:47,287 INFO L93 Difference]: Finished difference Result 578 states and 579 transitions. [2018-10-15 13:14:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:14:47,288 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 553 [2018-10-15 13:14:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:47,291 INFO L225 Difference]: With dead ends: 578 [2018-10-15 13:14:47,291 INFO L226 Difference]: Without dead ends: 578 [2018-10-15 13:14:47,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13479, Invalid=61871, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:14:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-15 13:14:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 565. [2018-10-15 13:14:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-15 13:14:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 566 transitions. [2018-10-15 13:14:47,301 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 566 transitions. Word has length 553 [2018-10-15 13:14:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:47,302 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 566 transitions. [2018-10-15 13:14:47,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 13:14:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 566 transitions. [2018-10-15 13:14:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-10-15 13:14:47,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:47,305 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:47,305 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:47,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:47,306 INFO L82 PathProgramCache]: Analyzing trace with hash 125373938, now seen corresponding path program 59 times [2018-10-15 13:14:47,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 4935 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:52,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:52,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:14:52,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:14:52,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:14:52,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2051, Invalid=13951, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:14:52,548 INFO L87 Difference]: Start difference. First operand 565 states and 566 transitions. Second operand 127 states. [2018-10-15 13:15:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:08,226 INFO L93 Difference]: Finished difference Result 906 states and 907 transitions. [2018-10-15 13:15:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 13:15:08,226 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 564 [2018-10-15 13:15:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:08,228 INFO L225 Difference]: With dead ends: 906 [2018-10-15 13:15:08,228 INFO L226 Difference]: Without dead ends: 574 [2018-10-15 13:15:08,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28482 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=14499, Invalid=81911, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 13:15:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-15 13:15:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2018-10-15 13:15:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-15 13:15:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 573 transitions. [2018-10-15 13:15:08,234 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 573 transitions. Word has length 564 [2018-10-15 13:15:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:08,235 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 573 transitions. [2018-10-15 13:15:08,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:15:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 573 transitions. [2018-10-15 13:15:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-15 13:15:08,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:08,237 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:08,238 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:08,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1974658763, now seen corresponding path program 60 times [2018-10-15 13:15:08,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8221 backedges. 3286 proven. 4935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:11,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:11,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:15:11,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:15:11,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:15:11,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:15:11,255 INFO L87 Difference]: Start difference. First operand 572 states and 573 transitions. Second operand 99 states. [2018-10-15 13:15:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:20,557 INFO L93 Difference]: Finished difference Result 596 states and 597 transitions. [2018-10-15 13:15:20,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 13:15:20,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 571 [2018-10-15 13:15:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:20,561 INFO L225 Difference]: With dead ends: 596 [2018-10-15 13:15:20,561 INFO L226 Difference]: Without dead ends: 596 [2018-10-15 13:15:20,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26715 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14362, Invalid=66010, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 13:15:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-15 13:15:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 583. [2018-10-15 13:15:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-10-15 13:15:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-10-15 13:15:20,568 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 571 [2018-10-15 13:15:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:20,568 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-10-15 13:15:20,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:15:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-10-15 13:15:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-10-15 13:15:20,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:20,571 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:20,571 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:20,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1312746835, now seen corresponding path program 61 times [2018-10-15 13:15:20,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 5270 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:26,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:26,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:15:26,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:15:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:15:26,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2181, Invalid=14849, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:15:26,150 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 131 states. [2018-10-15 13:15:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:42,701 INFO L93 Difference]: Finished difference Result 935 states and 936 transitions. [2018-10-15 13:15:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-15 13:15:42,701 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 582 [2018-10-15 13:15:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:42,703 INFO L225 Difference]: With dead ends: 935 [2018-10-15 13:15:42,703 INFO L226 Difference]: Without dead ends: 592 [2018-10-15 13:15:42,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30408 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=15415, Invalid=87305, Unknown=0, NotChecked=0, Total=102720 [2018-10-15 13:15:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-15 13:15:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2018-10-15 13:15:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-15 13:15:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 591 transitions. [2018-10-15 13:15:42,709 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 591 transitions. Word has length 582 [2018-10-15 13:15:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:42,709 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 591 transitions. [2018-10-15 13:15:42,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:15:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 591 transitions. [2018-10-15 13:15:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 13:15:42,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:42,712 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:42,712 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:42,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:42,713 INFO L82 PathProgramCache]: Analyzing trace with hash 404726252, now seen corresponding path program 62 times [2018-10-15 13:15:42,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8774 backedges. 3504 proven. 5270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:45,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:45,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 13:15:45,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 13:15:45,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 13:15:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 13:15:45,686 INFO L87 Difference]: Start difference. First operand 590 states and 591 transitions. Second operand 102 states. [2018-10-15 13:15:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:55,085 INFO L93 Difference]: Finished difference Result 614 states and 615 transitions. [2018-10-15 13:15:55,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 13:15:55,085 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 589 [2018-10-15 13:15:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:55,088 INFO L225 Difference]: With dead ends: 614 [2018-10-15 13:15:55,088 INFO L226 Difference]: Without dead ends: 614 [2018-10-15 13:15:55,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 13:15:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-15 13:15:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 601. [2018-10-15 13:15:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-15 13:15:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-10-15 13:15:55,095 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 589 [2018-10-15 13:15:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:55,096 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-10-15 13:15:55,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 13:15:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-10-15 13:15:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-10-15 13:15:55,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:55,099 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:55,099 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:55,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:55,099 INFO L82 PathProgramCache]: Analyzing trace with hash -234511470, now seen corresponding path program 63 times [2018-10-15 13:15:55,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 5616 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:00,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:16:00,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:16:00,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:16:00,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2315, Invalid=15775, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:16:00,809 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 135 states. [2018-10-15 13:16:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:18,394 INFO L93 Difference]: Finished difference Result 964 states and 965 transitions. [2018-10-15 13:16:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 13:16:18,394 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 600 [2018-10-15 13:16:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:18,396 INFO L225 Difference]: With dead ends: 964 [2018-10-15 13:16:18,396 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 13:16:18,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32397 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=16359, Invalid=92871, Unknown=0, NotChecked=0, Total=109230 [2018-10-15 13:16:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 13:16:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2018-10-15 13:16:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-15 13:16:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2018-10-15 13:16:18,403 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 600 [2018-10-15 13:16:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:18,404 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2018-10-15 13:16:18,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:16:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2018-10-15 13:16:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-10-15 13:16:18,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:18,407 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:18,407 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:18,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:18,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1149910037, now seen corresponding path program 64 times [2018-10-15 13:16:18,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9345 backedges. 3729 proven. 5616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:21,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:21,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:16:21,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:16:21,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:16:21,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:16:21,573 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 105 states. [2018-10-15 13:16:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:31,408 INFO L93 Difference]: Finished difference Result 632 states and 633 transitions. [2018-10-15 13:16:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 13:16:31,409 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 607 [2018-10-15 13:16:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:31,411 INFO L225 Difference]: With dead ends: 632 [2018-10-15 13:16:31,412 INFO L226 Difference]: Without dead ends: 632 [2018-10-15 13:16:31,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 13:16:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-15 13:16:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2018-10-15 13:16:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-15 13:16:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 620 transitions. [2018-10-15 13:16:31,419 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 620 transitions. Word has length 607 [2018-10-15 13:16:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:31,419 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 620 transitions. [2018-10-15 13:16:31,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 13:16:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 620 transitions. [2018-10-15 13:16:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-15 13:16:31,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:31,422 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:31,423 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:31,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:31,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1925931981, now seen corresponding path program 65 times [2018-10-15 13:16:31,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 5973 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:37,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:16:37,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:16:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:16:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2453, Invalid=16729, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:16:37,575 INFO L87 Difference]: Start difference. First operand 619 states and 620 transitions. Second operand 139 states. [2018-10-15 13:16:55,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:55,886 INFO L93 Difference]: Finished difference Result 993 states and 994 transitions. [2018-10-15 13:16:55,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-15 13:16:55,886 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 618 [2018-10-15 13:16:55,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:55,888 INFO L225 Difference]: With dead ends: 993 [2018-10-15 13:16:55,888 INFO L226 Difference]: Without dead ends: 628 [2018-10-15 13:16:55,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34449 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=17331, Invalid=98609, Unknown=0, NotChecked=0, Total=115940 [2018-10-15 13:16:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-15 13:16:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2018-10-15 13:16:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-15 13:16:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 627 transitions. [2018-10-15 13:16:55,894 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 627 transitions. Word has length 618 [2018-10-15 13:16:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:55,894 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 627 transitions. [2018-10-15 13:16:55,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:16:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 627 transitions. [2018-10-15 13:16:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-10-15 13:16:55,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:55,897 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:55,898 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:55,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1491552180, now seen corresponding path program 66 times [2018-10-15 13:16:55,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9934 backedges. 3961 proven. 5973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:59,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:59,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 13:16:59,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 13:16:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 13:16:59,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 13:16:59,412 INFO L87 Difference]: Start difference. First operand 626 states and 627 transitions. Second operand 108 states. [2018-10-15 13:17:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:09,124 INFO L93 Difference]: Finished difference Result 650 states and 651 transitions. [2018-10-15 13:17:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 13:17:09,124 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 625 [2018-10-15 13:17:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:09,127 INFO L225 Difference]: With dead ends: 650 [2018-10-15 13:17:09,127 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 13:17:09,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 13:17:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 13:17:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 637. [2018-10-15 13:17:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-10-15 13:17:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 638 transitions. [2018-10-15 13:17:09,134 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 638 transitions. Word has length 625 [2018-10-15 13:17:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:09,134 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 638 transitions. [2018-10-15 13:17:09,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 13:17:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 638 transitions. [2018-10-15 13:17:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-10-15 13:17:09,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:09,137 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:09,138 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:09,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1539256014, now seen corresponding path program 67 times [2018-10-15 13:17:09,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat