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/array_true-unreach-call4_true-termination.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:21,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:21,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:21,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:21,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:21,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:21,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:21,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:21,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:21,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:21,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:21,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:21,231 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:21,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:21,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:21,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:21,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:21,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:21,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:21,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:21,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:21,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:21,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:21,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:21,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:21,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:21,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:21,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:21,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:21,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:21,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:21,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:21,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:21,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:21,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:21,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:21,255 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 12:55:21,265 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:21,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:21,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:21,267 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:21,267 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:21,267 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:21,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:21,268 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:21,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:21,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:21,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:21,269 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:21,269 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:21,270 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:21,270 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:21,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:21,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:21,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:21,361 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:21,361 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:21,362 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call4_true-termination.i_5.bpl [2018-10-15 12:55:21,363 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call4_true-termination.i_5.bpl' [2018-10-15 12:55:21,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:21,451 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:21,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:21,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:21,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:21,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:21,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:21,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (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 12:55:21,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:21,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:22,213 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:22,214 INFO L202 PluginConnector]: Adding new model array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22 BoogieIcfgContainer [2018-10-15 12:55:22,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:22,215 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:22,215 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:22,216 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:22,220 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (1/1) ... [2018-10-15 12:55:22,228 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 12:55:22,229 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 12:55:22,268 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 12:55:22,313 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 12:55:22,328 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 12:55:22,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 12:55:25,532 INFO L315 AbstractInterpreter]: Visited 44 different actions 93 times. Merged at 26 different actions 45 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-15 12:55:25,537 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 12:55:25,540 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 12:55:25,554 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_2|) |v_ULTIMATE.start_read~int_#ptr.offset_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:25,584 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_2_1_1| |v_ULTIMATE.start_main_~#A~0.base_3|) at (#memory_int := #memory_int[main_~#A~0.base := #memory_int[main_~#A~0.base][main_~#A~0.offset + 4092 := 0]];) [2018-10-15 12:55:25,610 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_4_1_1| |v_ULTIMATE.start_main_~#A~0.base_4|) at (#memory_int := #memory_int[main_~#A~0.base := #memory_int[main_~#A~0.base][main_~#A~0.offset + 4 * main_~i~0 := main_#t~nondet1]];) [2018-10-15 12:55:25,612 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 12:55:25,613 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-15 12:55:25,613 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,613 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-15 12:55:25,613 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,618 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,619 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-15 12:55:25,619 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,620 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 12:55:25,639 INFO L202 PluginConnector]: Adding new model array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25 BasicIcfg [2018-10-15 12:55:25,639 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:25,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:25,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:25,645 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:25,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/3) ... [2018-10-15 12:55:25,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2f919c and model type array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:25, skipping insertion in model container [2018-10-15 12:55:25,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (2/3) ... [2018-10-15 12:55:25,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2f919c and model type array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:25, skipping insertion in model container [2018-10-15 12:55:25,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25" (3/3) ... [2018-10-15 12:55:25,651 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 12:55:25,666 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:25,676 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:25,696 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:25,723 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:25,724 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:25,724 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:25,725 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:25,725 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:25,725 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:25,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:25,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:25,726 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-10-15 12:55:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:55:25,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:25,758 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] [2018-10-15 12:55:25,759 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:25,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:25,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1731284566, now seen corresponding path program 1 times [2018-10-15 12:55:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,022 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 12:55:26,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:26,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:26,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:26,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:26,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:26,052 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-10-15 12:55:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:26,359 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-10-15 12:55:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:26,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-15 12:55:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:26,376 INFO L225 Difference]: With dead ends: 62 [2018-10-15 12:55:26,378 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 12:55:26,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 12:55:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2018-10-15 12:55:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 12:55:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-10-15 12:55:26,492 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 30 [2018-10-15 12:55:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,492 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-10-15 12:55:26,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-10-15 12:55:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:55:26,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,495 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, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:26,496 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1523228267, now seen corresponding path program 1 times [2018-10-15 12:55:26,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:26,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:26,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:26,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:26,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:26,813 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 5 states. [2018-10-15 12:55:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,357 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-10-15 12:55:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:27,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-15 12:55:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,360 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:55:27,360 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:55:27,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:55:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2018-10-15 12:55:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 12:55:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-15 12:55:27,368 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 37 [2018-10-15 12:55:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,368 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-15 12:55:27,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-15 12:55:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 12:55:27,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,371 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-10-15 12:55:27,371 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1131414346, now seen corresponding path program 2 times [2018-10-15 12:55:27,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:27,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:27,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:27,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:27,848 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 7 states. [2018-10-15 12:55:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,113 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-10-15 12:55:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:28,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-15 12:55:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,117 INFO L225 Difference]: With dead ends: 76 [2018-10-15 12:55:28,117 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 12:55:28,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 12:55:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2018-10-15 12:55:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:55:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-10-15 12:55:28,124 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 44 [2018-10-15 12:55:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,125 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-10-15 12:55:28,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-10-15 12:55:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 12:55:28,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,127 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:28,127 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -526580725, now seen corresponding path program 3 times [2018-10-15 12:55:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:28,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:28,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:28,448 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 9 states. [2018-10-15 12:55:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,661 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-10-15 12:55:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:28,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-15 12:55:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,664 INFO L225 Difference]: With dead ends: 83 [2018-10-15 12:55:28,664 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 12:55:28,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 12:55:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-10-15 12:55:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 12:55:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-15 12:55:28,673 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 51 [2018-10-15 12:55:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,673 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-15 12:55:28,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-15 12:55:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:55:28,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,676 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:28,676 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash 703464214, now seen corresponding path program 4 times [2018-10-15 12:55:28,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:29,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:29,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:29,278 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 11 states. [2018-10-15 12:55:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,701 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-10-15 12:55:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:29,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-15 12:55:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,704 INFO L225 Difference]: With dead ends: 90 [2018-10-15 12:55:29,704 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:55:29,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:55:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-10-15 12:55:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:55:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-10-15 12:55:29,712 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 58 [2018-10-15 12:55:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,712 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-10-15 12:55:29,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-10-15 12:55:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 12:55:29,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,714 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,714 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1996680789, now seen corresponding path program 5 times [2018-10-15 12:55:29,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:29,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:29,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:29,998 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 13 states. [2018-10-15 12:55:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,291 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-15 12:55:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:30,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-10-15 12:55:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,293 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:55:30,293 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:55:30,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:55:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-10-15 12:55:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 12:55:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-10-15 12:55:30,300 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 65 [2018-10-15 12:55:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,300 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-10-15 12:55:30,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-10-15 12:55:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:55:30,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,303 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:30,303 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1315872394, now seen corresponding path program 6 times [2018-10-15 12:55:30,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:30,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:30,513 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 15 states. [2018-10-15 12:55:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,920 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-10-15 12:55:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:30,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-10-15 12:55:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,923 INFO L225 Difference]: With dead ends: 104 [2018-10-15 12:55:30,923 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:55:30,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:55:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-10-15 12:55:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 12:55:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-10-15 12:55:30,931 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 72 [2018-10-15 12:55:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,931 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-10-15 12:55:30,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-10-15 12:55:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:55:30,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,933 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:30,933 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1457833803, now seen corresponding path program 7 times [2018-10-15 12:55:30,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:31,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:31,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:31,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:31,139 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2018-10-15 12:55:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:31,593 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-10-15 12:55:31,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:31,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-10-15 12:55:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:31,595 INFO L225 Difference]: With dead ends: 111 [2018-10-15 12:55:31,596 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 12:55:31,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 12:55:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2018-10-15 12:55:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:55:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-15 12:55:31,604 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 79 [2018-10-15 12:55:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:31,604 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-15 12:55:31,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-15 12:55:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 12:55:31,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:31,606 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:31,606 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:31,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:31,607 INFO L82 PathProgramCache]: Analyzing trace with hash -482338858, now seen corresponding path program 8 times [2018-10-15 12:55:31,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:32,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:32,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:32,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:32,128 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 19 states. [2018-10-15 12:55:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:32,715 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2018-10-15 12:55:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:32,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-10-15 12:55:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:32,717 INFO L225 Difference]: With dead ends: 118 [2018-10-15 12:55:32,717 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:55:32,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:55:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2018-10-15 12:55:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 12:55:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-10-15 12:55:32,724 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 86 [2018-10-15 12:55:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:32,725 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-10-15 12:55:32,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-10-15 12:55:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 12:55:32,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:32,727 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:32,727 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:32,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1882315541, now seen corresponding path program 9 times [2018-10-15 12:55:32,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:33,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:33,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:33,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:33,021 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2018-10-15 12:55:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:33,496 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-10-15 12:55:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:33,497 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-10-15 12:55:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:33,499 INFO L225 Difference]: With dead ends: 125 [2018-10-15 12:55:33,499 INFO L226 Difference]: Without dead ends: 125 [2018-10-15 12:55:33,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-15 12:55:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2018-10-15 12:55:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:55:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-10-15 12:55:33,507 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 93 [2018-10-15 12:55:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:33,508 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-10-15 12:55:33,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-10-15 12:55:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:55:33,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,510 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:33,510 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1010837046, now seen corresponding path program 10 times [2018-10-15 12:55:33,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:33,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:33,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:33,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:33,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:33,836 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 23 states. [2018-10-15 12:55:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,718 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-10-15 12:55:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:34,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-10-15 12:55:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,720 INFO L225 Difference]: With dead ends: 132 [2018-10-15 12:55:34,720 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 12:55:34,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 12:55:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-10-15 12:55:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-15 12:55:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-10-15 12:55:34,726 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 100 [2018-10-15 12:55:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,727 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-10-15 12:55:34,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-10-15 12:55:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 12:55:34,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,729 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,729 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1538468491, now seen corresponding path program 11 times [2018-10-15 12:55:34,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:35,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:35,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:35,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:35,100 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 25 states. [2018-10-15 12:55:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,681 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-10-15 12:55:35,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:35,681 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 107 [2018-10-15 12:55:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,683 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:55:35,683 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 12:55:35,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 12:55:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2018-10-15 12:55:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:55:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-15 12:55:35,688 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 107 [2018-10-15 12:55:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,689 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-15 12:55:35,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-15 12:55:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:55:35,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,691 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,691 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2024305514, now seen corresponding path program 12 times [2018-10-15 12:55:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:36,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:36,134 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 27 states. [2018-10-15 12:55:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,810 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2018-10-15 12:55:36,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:36,810 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2018-10-15 12:55:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,811 INFO L225 Difference]: With dead ends: 146 [2018-10-15 12:55:36,811 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 12:55:36,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 12:55:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2018-10-15 12:55:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 12:55:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-10-15 12:55:36,815 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 114 [2018-10-15 12:55:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,816 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-10-15 12:55:36,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-10-15 12:55:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:55:36,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,817 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,817 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1695406123, now seen corresponding path program 13 times [2018-10-15 12:55:36,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:37,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:37,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:37,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:37,574 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 29 states. [2018-10-15 12:55:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,648 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-10-15 12:55:38,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:38,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-10-15 12:55:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,650 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:55:38,651 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:55:38,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:55:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2018-10-15 12:55:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:55:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-10-15 12:55:38,655 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 121 [2018-10-15 12:55:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,655 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-10-15 12:55:38,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-10-15 12:55:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 12:55:38,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,656 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,656 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1020021494, now seen corresponding path program 14 times [2018-10-15 12:55:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:39,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:39,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:39,100 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-10-15 12:55:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,713 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2018-10-15 12:55:39,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:39,714 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-10-15 12:55:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,716 INFO L225 Difference]: With dead ends: 160 [2018-10-15 12:55:39,716 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 12:55:39,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 12:55:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-10-15 12:55:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:55:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 12:55:39,721 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 128 [2018-10-15 12:55:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,722 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 12:55:39,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 12:55:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 12:55:39,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,724 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,725 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2027433419, now seen corresponding path program 15 times [2018-10-15 12:55:39,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:40,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:40,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:40,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:40,248 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 33 states. [2018-10-15 12:55:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,993 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-10-15 12:55:40,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:40,995 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 135 [2018-10-15 12:55:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,997 INFO L225 Difference]: With dead ends: 167 [2018-10-15 12:55:40,998 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 12:55:41,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 12:55:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2018-10-15 12:55:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:55:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-15 12:55:41,004 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 135 [2018-10-15 12:55:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,004 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-15 12:55:41,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-15 12:55:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:55:41,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,006 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,006 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,007 INFO L82 PathProgramCache]: Analyzing trace with hash -496737962, now seen corresponding path program 16 times [2018-10-15 12:55:41,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:41,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:41,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:41,585 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 35 states. [2018-10-15 12:55:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,838 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-10-15 12:55:42,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:42,838 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-10-15 12:55:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,840 INFO L225 Difference]: With dead ends: 174 [2018-10-15 12:55:42,840 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 12:55:42,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 12:55:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-10-15 12:55:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 12:55:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-10-15 12:55:42,846 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 142 [2018-10-15 12:55:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:42,846 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-10-15 12:55:42,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-10-15 12:55:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:55:42,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:42,847 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:42,848 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:42,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 646720363, now seen corresponding path program 17 times [2018-10-15 12:55:42,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:43,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:43,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:43,856 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 37 states. [2018-10-15 12:55:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:44,699 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-10-15 12:55:44,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:44,700 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-10-15 12:55:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:44,702 INFO L225 Difference]: With dead ends: 181 [2018-10-15 12:55:44,702 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 12:55:44,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 12:55:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2018-10-15 12:55:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:55:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-10-15 12:55:44,707 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 149 [2018-10-15 12:55:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:44,707 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-10-15 12:55:44,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-10-15 12:55:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:55:44,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:44,708 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:44,708 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:44,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:44,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1801834422, now seen corresponding path program 18 times [2018-10-15 12:55:44,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:45,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:45,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:45,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:45,311 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 39 states. [2018-10-15 12:55:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:46,271 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-15 12:55:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:46,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 156 [2018-10-15 12:55:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:46,273 INFO L225 Difference]: With dead ends: 188 [2018-10-15 12:55:46,273 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 12:55:46,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 12:55:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2018-10-15 12:55:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 12:55:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-10-15 12:55:46,280 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 156 [2018-10-15 12:55:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:46,280 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-10-15 12:55:46,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-10-15 12:55:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:55:46,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:46,281 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:46,282 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:46,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:46,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1612960011, now seen corresponding path program 19 times [2018-10-15 12:55:46,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:47,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:47,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:47,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:47,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:47,761 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 41 states. [2018-10-15 12:55:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:48,887 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-10-15 12:55:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:48,887 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-10-15 12:55:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:48,889 INFO L225 Difference]: With dead ends: 195 [2018-10-15 12:55:48,889 INFO L226 Difference]: Without dead ends: 195 [2018-10-15 12:55:48,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-15 12:55:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 175. [2018-10-15 12:55:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 12:55:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-15 12:55:48,895 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 163 [2018-10-15 12:55:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:48,895 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-15 12:55:48,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-15 12:55:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:55:48,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:48,897 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:48,897 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:48,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1734961642, now seen corresponding path program 20 times [2018-10-15 12:55:48,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:49,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:49,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:49,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:49,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:49,762 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 43 states. [2018-10-15 12:55:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:50,824 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-10-15 12:55:50,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:50,825 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-10-15 12:55:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:50,826 INFO L225 Difference]: With dead ends: 202 [2018-10-15 12:55:50,827 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 12:55:50,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 12:55:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2018-10-15 12:55:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:55:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-10-15 12:55:50,833 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 170 [2018-10-15 12:55:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:50,833 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-10-15 12:55:50,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-10-15 12:55:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-15 12:55:50,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:50,835 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:50,835 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:50,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash 437853867, now seen corresponding path program 21 times [2018-10-15 12:55:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:51,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:51,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:51,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:51,667 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 45 states. [2018-10-15 12:55:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:53,181 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-10-15 12:55:53,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:53,186 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-10-15 12:55:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:53,188 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:55:53,188 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:55:53,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:55:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-10-15 12:55:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 12:55:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-10-15 12:55:53,194 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 177 [2018-10-15 12:55:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:53,194 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-10-15 12:55:53,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-10-15 12:55:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:55:53,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:53,196 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:53,196 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:53,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1480373366, now seen corresponding path program 22 times [2018-10-15 12:55:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:54,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:54,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:55:54,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:55:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:55:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:54,632 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 47 states. [2018-10-15 12:55:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:56,162 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-10-15 12:55:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:55:56,163 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 184 [2018-10-15 12:55:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:56,165 INFO L225 Difference]: With dead ends: 216 [2018-10-15 12:55:56,165 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:55:56,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:55:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:55:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 196. [2018-10-15 12:55:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 12:55:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-10-15 12:55:56,171 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 184 [2018-10-15 12:55:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:56,171 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-10-15 12:55:56,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:55:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-10-15 12:55:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 12:55:56,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:56,173 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:56,173 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:56,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -345631669, now seen corresponding path program 23 times [2018-10-15 12:55:56,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:57,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:57,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:55:57,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:55:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:55:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:55:57,070 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 49 states. [2018-10-15 12:55:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:59,338 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2018-10-15 12:55:59,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:55:59,340 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 191 [2018-10-15 12:55:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:59,341 INFO L225 Difference]: With dead ends: 223 [2018-10-15 12:55:59,341 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 12:55:59,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:55:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 12:55:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2018-10-15 12:55:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 12:55:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-10-15 12:55:59,346 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 191 [2018-10-15 12:55:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:59,347 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-10-15 12:55:59,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:55:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-10-15 12:55:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-15 12:55:59,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:59,348 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:59,349 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:59,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash 639511254, now seen corresponding path program 24 times [2018-10-15 12:55:59,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:00,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:00,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:00,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:00,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:00,207 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 51 states. [2018-10-15 12:56:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:02,903 INFO L93 Difference]: Finished difference Result 230 states and 231 transitions. [2018-10-15 12:56:02,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:02,904 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-15 12:56:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:02,906 INFO L225 Difference]: With dead ends: 230 [2018-10-15 12:56:02,906 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 12:56:02,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 12:56:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 210. [2018-10-15 12:56:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 12:56:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-10-15 12:56:02,911 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 198 [2018-10-15 12:56:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:02,911 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-10-15 12:56:02,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-10-15 12:56:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 12:56:02,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:02,913 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:02,913 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:02,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:02,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1383812629, now seen corresponding path program 25 times [2018-10-15 12:56:02,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 0 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:04,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:04,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:04,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:04,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:04,379 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 53 states. [2018-10-15 12:56:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:06,119 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-10-15 12:56:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:06,122 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 205 [2018-10-15 12:56:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:06,123 INFO L225 Difference]: With dead ends: 237 [2018-10-15 12:56:06,123 INFO L226 Difference]: Without dead ends: 237 [2018-10-15 12:56:06,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-15 12:56:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2018-10-15 12:56:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 12:56:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-15 12:56:06,129 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 205 [2018-10-15 12:56:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:06,129 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-15 12:56:06,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-15 12:56:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 12:56:06,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:06,131 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:06,131 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:06,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1803614518, now seen corresponding path program 26 times [2018-10-15 12:56:06,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:07,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:07,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:07,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:07,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:07,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:07,330 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 55 states. [2018-10-15 12:56:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:09,648 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2018-10-15 12:56:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:09,648 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2018-10-15 12:56:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:09,650 INFO L225 Difference]: With dead ends: 244 [2018-10-15 12:56:09,650 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 12:56:09,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 12:56:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 224. [2018-10-15 12:56:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:56:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2018-10-15 12:56:09,655 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 212 [2018-10-15 12:56:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:09,655 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2018-10-15 12:56:09,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2018-10-15 12:56:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:56:09,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:09,657 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:09,657 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:09,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:09,658 INFO L82 PathProgramCache]: Analyzing trace with hash 477034379, now seen corresponding path program 27 times [2018-10-15 12:56:09,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:10,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:10,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:10,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:10,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:10,869 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 57 states. [2018-10-15 12:56:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:12,854 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2018-10-15 12:56:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:12,855 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 219 [2018-10-15 12:56:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:12,856 INFO L225 Difference]: With dead ends: 251 [2018-10-15 12:56:12,856 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 12:56:12,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 12:56:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-10-15 12:56:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 12:56:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-15 12:56:12,861 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 219 [2018-10-15 12:56:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:12,861 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-15 12:56:12,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-15 12:56:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:56:12,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:12,863 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:12,863 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:12,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash -550821994, now seen corresponding path program 28 times [2018-10-15 12:56:12,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2674 backedges. 0 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:14,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:14,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:14,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:14,719 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2018-10-15 12:56:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:16,747 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2018-10-15 12:56:16,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:16,747 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 226 [2018-10-15 12:56:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:16,749 INFO L225 Difference]: With dead ends: 258 [2018-10-15 12:56:16,749 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 12:56:16,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 12:56:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2018-10-15 12:56:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-15 12:56:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-10-15 12:56:16,755 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 226 [2018-10-15 12:56:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:16,755 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-10-15 12:56:16,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-10-15 12:56:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 12:56:16,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:16,757 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:16,757 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:16,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1990124843, now seen corresponding path program 29 times [2018-10-15 12:56:16,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:18,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:18,220 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 61 states. [2018-10-15 12:56:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:20,416 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-10-15 12:56:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:20,416 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 233 [2018-10-15 12:56:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:20,418 INFO L225 Difference]: With dead ends: 265 [2018-10-15 12:56:20,418 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 12:56:20,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 12:56:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 245. [2018-10-15 12:56:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:56:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-10-15 12:56:20,424 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 233 [2018-10-15 12:56:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:20,424 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-10-15 12:56:20,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-10-15 12:56:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:56:20,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:20,426 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:20,426 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:20,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash -446521866, now seen corresponding path program 30 times [2018-10-15 12:56:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 0 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:22,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:22,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:22,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:22,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:22,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:22,432 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 63 states. [2018-10-15 12:56:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:25,104 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-10-15 12:56:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:25,104 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 240 [2018-10-15 12:56:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:25,106 INFO L225 Difference]: With dead ends: 272 [2018-10-15 12:56:25,106 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 12:56:25,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 12:56:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2018-10-15 12:56:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-15 12:56:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 253 transitions. [2018-10-15 12:56:25,110 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 253 transitions. Word has length 240 [2018-10-15 12:56:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:25,110 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 253 transitions. [2018-10-15 12:56:25,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 253 transitions. [2018-10-15 12:56:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 12:56:25,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:25,111 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:25,112 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:25,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash 487488203, now seen corresponding path program 31 times [2018-10-15 12:56:25,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 0 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:26,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:26,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:26,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:26,500 INFO L87 Difference]: Start difference. First operand 252 states and 253 transitions. Second operand 65 states. [2018-10-15 12:56:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:29,253 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-10-15 12:56:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:29,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 247 [2018-10-15 12:56:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:29,255 INFO L225 Difference]: With dead ends: 279 [2018-10-15 12:56:29,256 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:56:29,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:56:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 259. [2018-10-15 12:56:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 12:56:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-15 12:56:29,261 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 247 [2018-10-15 12:56:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:29,261 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-15 12:56:29,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-15 12:56:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 12:56:29,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:29,263 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:29,263 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:29,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash -269650858, now seen corresponding path program 32 times [2018-10-15 12:56:29,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 0 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:30,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:30,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:30,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:30,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:30,796 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 67 states. [2018-10-15 12:56:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:33,385 INFO L93 Difference]: Finished difference Result 286 states and 287 transitions. [2018-10-15 12:56:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:33,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 254 [2018-10-15 12:56:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:33,386 INFO L225 Difference]: With dead ends: 286 [2018-10-15 12:56:33,386 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 12:56:33,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 12:56:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 266. [2018-10-15 12:56:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:56:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2018-10-15 12:56:33,393 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 254 [2018-10-15 12:56:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:33,393 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2018-10-15 12:56:33,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2018-10-15 12:56:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-15 12:56:33,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:33,395 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:33,395 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:33,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:33,396 INFO L82 PathProgramCache]: Analyzing trace with hash 859289707, now seen corresponding path program 33 times [2018-10-15 12:56:33,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3729 backedges. 0 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:35,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:35,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:35,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:35,142 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 69 states. [2018-10-15 12:56:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:38,072 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-10-15 12:56:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:38,072 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 261 [2018-10-15 12:56:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:38,074 INFO L225 Difference]: With dead ends: 293 [2018-10-15 12:56:38,074 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 12:56:38,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 12:56:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 273. [2018-10-15 12:56:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 12:56:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-10-15 12:56:38,078 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 261 [2018-10-15 12:56:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:38,078 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-10-15 12:56:38,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-10-15 12:56:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 12:56:38,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:38,079 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:38,079 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:38,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash -569269578, now seen corresponding path program 34 times [2018-10-15 12:56:38,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 0 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:40,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:40,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:40,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:40,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:40,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:40,762 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 71 states. [2018-10-15 12:56:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:43,847 INFO L93 Difference]: Finished difference Result 300 states and 301 transitions. [2018-10-15 12:56:43,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:43,847 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 268 [2018-10-15 12:56:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:43,849 INFO L225 Difference]: With dead ends: 300 [2018-10-15 12:56:43,849 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 12:56:43,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 12:56:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 280. [2018-10-15 12:56:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 12:56:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-10-15 12:56:43,854 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 268 [2018-10-15 12:56:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:43,854 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-10-15 12:56:43,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-10-15 12:56:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 12:56:43,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:43,856 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 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 12:56:43,856 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:43,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1058315787, now seen corresponding path program 35 times [2018-10-15 12:56:43,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 4200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:45,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:45,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:45,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:45,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:45,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:45,571 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 73 states. [2018-10-15 12:56:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:48,511 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-10-15 12:56:48,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:48,512 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 275 [2018-10-15 12:56:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:48,513 INFO L225 Difference]: With dead ends: 307 [2018-10-15 12:56:48,513 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 12:56:48,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 12:56:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2018-10-15 12:56:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-15 12:56:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-15 12:56:48,518 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 275 [2018-10-15 12:56:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:48,518 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-15 12:56:48,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-15 12:56:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 12:56:48,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:48,520 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 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 12:56:48,520 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:48,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:48,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1553279254, now seen corresponding path program 36 times [2018-10-15 12:56:48,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4446 backedges. 0 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:50,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:50,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:50,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:50,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:50,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:50,512 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 75 states. [2018-10-15 12:56:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:53,613 INFO L93 Difference]: Finished difference Result 314 states and 315 transitions. [2018-10-15 12:56:53,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:53,614 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 282 [2018-10-15 12:56:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:53,616 INFO L225 Difference]: With dead ends: 314 [2018-10-15 12:56:53,616 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 12:56:53,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 12:56:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2018-10-15 12:56:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 12:56:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-15 12:56:53,621 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 282 [2018-10-15 12:56:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:53,621 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-15 12:56:53,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-15 12:56:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:56:53,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:53,623 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 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 12:56:53,624 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:53,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash -920704085, now seen corresponding path program 37 times [2018-10-15 12:56:53,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4699 backedges. 0 proven. 4699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:55,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:55,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:56:55,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:56:55,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:56:55,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:56:55,595 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 77 states. [2018-10-15 12:56:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:59,142 INFO L93 Difference]: Finished difference Result 321 states and 322 transitions. [2018-10-15 12:56:59,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:56:59,143 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 289 [2018-10-15 12:56:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:59,145 INFO L225 Difference]: With dead ends: 321 [2018-10-15 12:56:59,145 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 12:56:59,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:56:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 12:56:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 301. [2018-10-15 12:56:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-15 12:56:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-10-15 12:56:59,150 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 289 [2018-10-15 12:56:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:59,150 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-10-15 12:56:59,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:56:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-10-15 12:56:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 12:56:59,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:59,152 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 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 12:56:59,152 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:59,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:59,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1170081654, now seen corresponding path program 38 times [2018-10-15 12:56:59,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:01,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:01,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:01,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:01,349 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 79 states. [2018-10-15 12:57:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:05,192 INFO L93 Difference]: Finished difference Result 328 states and 329 transitions. [2018-10-15 12:57:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:05,193 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 296 [2018-10-15 12:57:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:05,195 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:57:05,195 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 12:57:05,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 12:57:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 308. [2018-10-15 12:57:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:57:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2018-10-15 12:57:05,200 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 296 [2018-10-15 12:57:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:05,200 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2018-10-15 12:57:05,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2018-10-15 12:57:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-15 12:57:05,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:05,202 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 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 12:57:05,202 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:05,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash -61775541, now seen corresponding path program 39 times [2018-10-15 12:57:05,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 0 proven. 5226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:07,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:07,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:07,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:07,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:07,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:07,682 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 81 states. [2018-10-15 12:57:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:11,463 INFO L93 Difference]: Finished difference Result 335 states and 336 transitions. [2018-10-15 12:57:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:11,463 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 303 [2018-10-15 12:57:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:11,465 INFO L225 Difference]: With dead ends: 335 [2018-10-15 12:57:11,465 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 12:57:11,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 12:57:11,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 315. [2018-10-15 12:57:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 12:57:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-15 12:57:11,471 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 303 [2018-10-15 12:57:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:11,471 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-15 12:57:11,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-15 12:57:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-15 12:57:11,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:11,473 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 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 12:57:11,473 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:11,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash 22166998, now seen corresponding path program 40 times [2018-10-15 12:57:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5500 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:13,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:13,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:13,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:13,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:13,837 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 83 states. [2018-10-15 12:57:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:17,718 INFO L93 Difference]: Finished difference Result 342 states and 343 transitions. [2018-10-15 12:57:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:17,719 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 310 [2018-10-15 12:57:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:17,721 INFO L225 Difference]: With dead ends: 342 [2018-10-15 12:57:17,721 INFO L226 Difference]: Without dead ends: 342 [2018-10-15 12:57:17,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-15 12:57:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 322. [2018-10-15 12:57:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-15 12:57:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 323 transitions. [2018-10-15 12:57:17,728 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 323 transitions. Word has length 310 [2018-10-15 12:57:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:17,728 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 323 transitions. [2018-10-15 12:57:17,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 323 transitions. [2018-10-15 12:57:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-15 12:57:17,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:17,730 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 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 12:57:17,730 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:17,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:17,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1176846059, now seen corresponding path program 41 times [2018-10-15 12:57:17,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 0 proven. 5781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:20,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:20,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:20,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:20,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:20,224 INFO L87 Difference]: Start difference. First operand 322 states and 323 transitions. Second operand 85 states. [2018-10-15 12:57:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:24,108 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-10-15 12:57:24,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:24,108 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 317 [2018-10-15 12:57:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:24,110 INFO L225 Difference]: With dead ends: 349 [2018-10-15 12:57:24,110 INFO L226 Difference]: Without dead ends: 349 [2018-10-15 12:57:24,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-15 12:57:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 329. [2018-10-15 12:57:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-15 12:57:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-10-15 12:57:24,116 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 317 [2018-10-15 12:57:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:24,116 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-10-15 12:57:24,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-10-15 12:57:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-15 12:57:24,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:24,119 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 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 12:57:24,119 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:24,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash -459813834, now seen corresponding path program 42 times [2018-10-15 12:57:24,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 0 proven. 6069 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:26,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:26,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:26,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:26,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:26,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:26,775 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 87 states. [2018-10-15 12:57:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:31,244 INFO L93 Difference]: Finished difference Result 356 states and 357 transitions. [2018-10-15 12:57:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:31,244 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 324 [2018-10-15 12:57:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:31,246 INFO L225 Difference]: With dead ends: 356 [2018-10-15 12:57:31,246 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 12:57:31,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 12:57:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 336. [2018-10-15 12:57:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-15 12:57:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2018-10-15 12:57:31,252 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 324 [2018-10-15 12:57:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:31,252 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2018-10-15 12:57:31,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2018-10-15 12:57:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-15 12:57:31,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:31,254 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 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 12:57:31,254 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:31,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash -158022517, now seen corresponding path program 43 times [2018-10-15 12:57:31,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6364 backedges. 0 proven. 6364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:33,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:33,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:33,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:33,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:33,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:33,786 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 89 states. [2018-10-15 12:57:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:38,298 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2018-10-15 12:57:38,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:38,299 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 331 [2018-10-15 12:57:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:38,301 INFO L225 Difference]: With dead ends: 363 [2018-10-15 12:57:38,301 INFO L226 Difference]: Without dead ends: 363 [2018-10-15 12:57:38,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-15 12:57:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 343. [2018-10-15 12:57:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-15 12:57:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-10-15 12:57:38,306 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 331 [2018-10-15 12:57:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:38,306 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-10-15 12:57:38,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-10-15 12:57:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-15 12:57:38,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:38,308 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 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 12:57:38,308 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:38,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:38,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1839943018, now seen corresponding path program 44 times [2018-10-15 12:57:38,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 6666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:41,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:41,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:41,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:41,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:41,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:41,123 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 91 states. [2018-10-15 12:57:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:45,918 INFO L93 Difference]: Finished difference Result 370 states and 371 transitions. [2018-10-15 12:57:45,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:45,919 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 338 [2018-10-15 12:57:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:45,921 INFO L225 Difference]: With dead ends: 370 [2018-10-15 12:57:45,921 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 12:57:45,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 12:57:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 350. [2018-10-15 12:57:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:57:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 351 transitions. [2018-10-15 12:57:45,926 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 351 transitions. Word has length 338 [2018-10-15 12:57:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:45,926 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 351 transitions. [2018-10-15 12:57:45,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 351 transitions. [2018-10-15 12:57:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-15 12:57:45,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:45,928 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 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 12:57:45,929 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:45,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash -535170517, now seen corresponding path program 45 times [2018-10-15 12:57:45,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6975 backedges. 0 proven. 6975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:48,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:48,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:48,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:48,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:48,793 INFO L87 Difference]: Start difference. First operand 350 states and 351 transitions. Second operand 93 states. [2018-10-15 12:57:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:53,521 INFO L93 Difference]: Finished difference Result 377 states and 378 transitions. [2018-10-15 12:57:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:53,522 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 345 [2018-10-15 12:57:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:53,524 INFO L225 Difference]: With dead ends: 377 [2018-10-15 12:57:53,524 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 12:57:53,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 12:57:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2018-10-15 12:57:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-15 12:57:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-10-15 12:57:53,530 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 345 [2018-10-15 12:57:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:53,530 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-10-15 12:57:53,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-10-15 12:57:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 12:57:53,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:53,533 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 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 12:57:53,533 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:53,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1523511542, now seen corresponding path program 46 times [2018-10-15 12:57:53,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 0 proven. 7291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:56,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:56,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:56,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:56,531 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 95 states. [2018-10-15 12:58:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:01,467 INFO L93 Difference]: Finished difference Result 384 states and 385 transitions. [2018-10-15 12:58:01,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:58:01,468 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 352 [2018-10-15 12:58:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:01,470 INFO L225 Difference]: With dead ends: 384 [2018-10-15 12:58:01,470 INFO L226 Difference]: Without dead ends: 384 [2018-10-15 12:58:01,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:58:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-15 12:58:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 364. [2018-10-15 12:58:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-15 12:58:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 365 transitions. [2018-10-15 12:58:01,475 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 365 transitions. Word has length 352 [2018-10-15 12:58:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:01,476 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 365 transitions. [2018-10-15 12:58:01,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:58:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 365 transitions. [2018-10-15 12:58:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:58:01,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:01,477 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 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 12:58:01,478 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:01,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash -139540533, now seen corresponding path program 47 times [2018-10-15 12:58:01,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7614 backedges. 0 proven. 7614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:04,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:04,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:04,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:04,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:04,556 INFO L87 Difference]: Start difference. First operand 364 states and 365 transitions. Second operand 97 states. [2018-10-15 12:58:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:09,989 INFO L93 Difference]: Finished difference Result 391 states and 392 transitions. [2018-10-15 12:58:09,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:09,990 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 359 [2018-10-15 12:58:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:09,992 INFO L225 Difference]: With dead ends: 391 [2018-10-15 12:58:09,992 INFO L226 Difference]: Without dead ends: 391 [2018-10-15 12:58:09,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-15 12:58:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 371. [2018-10-15 12:58:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 12:58:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-10-15 12:58:09,999 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 359 [2018-10-15 12:58:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:09,999 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-10-15 12:58:10,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-10-15 12:58:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 12:58:10,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:10,002 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 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 12:58:10,002 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:10,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1681094826, now seen corresponding path program 48 times [2018-10-15 12:58:10,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7944 backedges. 0 proven. 7944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:13,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:13,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:13,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:13,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:13,417 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 99 states. [2018-10-15 12:58:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:19,025 INFO L93 Difference]: Finished difference Result 398 states and 399 transitions. [2018-10-15 12:58:19,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:19,025 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 366 [2018-10-15 12:58:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:19,027 INFO L225 Difference]: With dead ends: 398 [2018-10-15 12:58:19,027 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 12:58:19,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 12:58:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 378. [2018-10-15 12:58:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-15 12:58:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-10-15 12:58:19,032 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 366 [2018-10-15 12:58:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:19,033 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-10-15 12:58:19,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-10-15 12:58:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 12:58:19,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:19,034 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 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 12:58:19,035 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:19,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:19,035 INFO L82 PathProgramCache]: Analyzing trace with hash -187873941, now seen corresponding path program 49 times [2018-10-15 12:58:19,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:22,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:22,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:22,421 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 101 states. [2018-10-15 12:58:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:28,137 INFO L93 Difference]: Finished difference Result 405 states and 406 transitions. [2018-10-15 12:58:28,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:28,138 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 373 [2018-10-15 12:58:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:28,140 INFO L225 Difference]: With dead ends: 405 [2018-10-15 12:58:28,140 INFO L226 Difference]: Without dead ends: 405 [2018-10-15 12:58:28,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-15 12:58:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 385. [2018-10-15 12:58:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 12:58:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-10-15 12:58:28,147 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 373 [2018-10-15 12:58:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:28,147 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-10-15 12:58:28,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-10-15 12:58:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-15 12:58:28,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:28,150 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 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 12:58:28,150 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:28,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash 546534838, now seen corresponding path program 50 times [2018-10-15 12:58:28,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8625 backedges. 0 proven. 8625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:31,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:31,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:31,717 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 103 states. [2018-10-15 12:58:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:37,491 INFO L93 Difference]: Finished difference Result 412 states and 413 transitions. [2018-10-15 12:58:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:37,491 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 380 [2018-10-15 12:58:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:37,494 INFO L225 Difference]: With dead ends: 412 [2018-10-15 12:58:37,494 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 12:58:37,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 12:58:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 392. [2018-10-15 12:58:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:58:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2018-10-15 12:58:37,499 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 380 [2018-10-15 12:58:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:37,500 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2018-10-15 12:58:37,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2018-10-15 12:58:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-15 12:58:37,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:37,502 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 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 12:58:37,502 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:37,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -244356341, now seen corresponding path program 51 times [2018-10-15 12:58:37,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 8976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:40,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:40,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:40,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:40,972 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 105 states. [2018-10-15 12:58:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:47,504 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-10-15 12:58:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:47,505 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 387 [2018-10-15 12:58:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:47,506 INFO L225 Difference]: With dead ends: 419 [2018-10-15 12:58:47,506 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 12:58:47,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 12:58:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 399. [2018-10-15 12:58:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-15 12:58:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-10-15 12:58:47,511 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 387 [2018-10-15 12:58:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:47,512 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-10-15 12:58:47,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-10-15 12:58:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-15 12:58:47,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:47,513 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 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 12:58:47,513 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:47,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2115388394, now seen corresponding path program 52 times [2018-10-15 12:58:47,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9334 backedges. 0 proven. 9334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:51,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:51,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:51,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:51,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:51,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:51,149 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 107 states. [2018-10-15 12:58:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:57,809 INFO L93 Difference]: Finished difference Result 426 states and 427 transitions. [2018-10-15 12:58:57,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:58:57,809 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 394 [2018-10-15 12:58:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:57,811 INFO L225 Difference]: With dead ends: 426 [2018-10-15 12:58:57,811 INFO L226 Difference]: Without dead ends: 426 [2018-10-15 12:58:57,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:58:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-15 12:58:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 406. [2018-10-15 12:58:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-15 12:58:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 407 transitions. [2018-10-15 12:58:57,816 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 407 transitions. Word has length 394 [2018-10-15 12:58:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:57,816 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 407 transitions. [2018-10-15 12:58:57,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 407 transitions. [2018-10-15 12:58:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-15 12:58:57,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:57,818 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 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 12:58:57,818 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:57,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash 168769707, now seen corresponding path program 53 times [2018-10-15 12:58:57,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9699 backedges. 0 proven. 9699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:01,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:01,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:59:01,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:59:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:59:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:59:01,593 INFO L87 Difference]: Start difference. First operand 406 states and 407 transitions. Second operand 109 states. [2018-10-15 12:59:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:08,334 INFO L93 Difference]: Finished difference Result 433 states and 434 transitions. [2018-10-15 12:59:08,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:59:08,335 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 401 [2018-10-15 12:59:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:08,337 INFO L225 Difference]: With dead ends: 433 [2018-10-15 12:59:08,338 INFO L226 Difference]: Without dead ends: 433 [2018-10-15 12:59:08,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:59:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-15 12:59:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 413. [2018-10-15 12:59:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-15 12:59:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-10-15 12:59:08,342 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 401 [2018-10-15 12:59:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:08,342 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-10-15 12:59:08,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-10-15 12:59:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-15 12:59:08,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:08,344 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 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 12:59:08,344 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:08,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:08,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2045420938, now seen corresponding path program 54 times [2018-10-15 12:59:08,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10071 backedges. 0 proven. 10071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:12,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:12,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:12,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:12,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:12,404 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 111 states. [2018-10-15 12:59:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:19,210 INFO L93 Difference]: Finished difference Result 440 states and 441 transitions. [2018-10-15 12:59:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:19,210 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 408 [2018-10-15 12:59:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:19,212 INFO L225 Difference]: With dead ends: 440 [2018-10-15 12:59:19,212 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 12:59:19,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 12:59:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 420. [2018-10-15 12:59:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 12:59:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-15 12:59:19,217 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 408 [2018-10-15 12:59:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:19,217 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-15 12:59:19,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-15 12:59:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 12:59:19,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:19,219 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 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 12:59:19,219 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:19,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:19,219 INFO L82 PathProgramCache]: Analyzing trace with hash -39408053, now seen corresponding path program 55 times [2018-10-15 12:59:19,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10450 backedges. 0 proven. 10450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:23,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:23,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:23,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:23,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:23,272 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 113 states. [2018-10-15 12:59:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:30,361 INFO L93 Difference]: Finished difference Result 447 states and 448 transitions. [2018-10-15 12:59:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:30,361 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 415 [2018-10-15 12:59:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:30,363 INFO L225 Difference]: With dead ends: 447 [2018-10-15 12:59:30,363 INFO L226 Difference]: Without dead ends: 447 [2018-10-15 12:59:30,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:59:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-15 12:59:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 427. [2018-10-15 12:59:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-15 12:59:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-10-15 12:59:30,368 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 415 [2018-10-15 12:59:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:30,368 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-10-15 12:59:30,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-10-15 12:59:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-15 12:59:30,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:30,370 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 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 12:59:30,370 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:30,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2133045034, now seen corresponding path program 56 times [2018-10-15 12:59:30,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10836 backedges. 0 proven. 10836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:34,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:34,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:34,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:34,619 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 115 states. [2018-10-15 12:59:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:41,859 INFO L93 Difference]: Finished difference Result 454 states and 455 transitions. [2018-10-15 12:59:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:41,859 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 422 [2018-10-15 12:59:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:41,861 INFO L225 Difference]: With dead ends: 454 [2018-10-15 12:59:41,861 INFO L226 Difference]: Without dead ends: 454 [2018-10-15 12:59:41,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-15 12:59:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-10-15 12:59:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:59:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-10-15 12:59:41,866 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 422 [2018-10-15 12:59:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:41,866 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-10-15 12:59:41,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-10-15 12:59:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:59:41,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:41,868 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 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 12:59:41,868 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:41,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash -844117013, now seen corresponding path program 57 times [2018-10-15 12:59:41,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11229 backedges. 0 proven. 11229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:46,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:46,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:46,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:46,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:46,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:46,085 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 117 states. [2018-10-15 12:59:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:53,421 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2018-10-15 12:59:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:53,421 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 429 [2018-10-15 12:59:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:53,423 INFO L225 Difference]: With dead ends: 461 [2018-10-15 12:59:53,423 INFO L226 Difference]: Without dead ends: 461 [2018-10-15 12:59:53,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-15 12:59:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 441. [2018-10-15 12:59:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-15 12:59:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-10-15 12:59:53,427 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 429 [2018-10-15 12:59:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:53,428 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-10-15 12:59:53,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-10-15 12:59:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-15 12:59:53,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:53,430 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 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 12:59:53,430 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:53,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1283154122, now seen corresponding path program 58 times [2018-10-15 12:59:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 11629 backedges. 0 proven. 11629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:57,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:57,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:57,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:57,642 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 119 states. [2018-10-15 13:00:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:05,240 INFO L93 Difference]: Finished difference Result 468 states and 469 transitions. [2018-10-15 13:00:05,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 13:00:05,240 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 436 [2018-10-15 13:00:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:05,243 INFO L225 Difference]: With dead ends: 468 [2018-10-15 13:00:05,243 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 13:00:05,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 13:00:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 13:00:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 448. [2018-10-15 13:00:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-15 13:00:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2018-10-15 13:00:05,248 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 436 [2018-10-15 13:00:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:05,248 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2018-10-15 13:00:05,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:00:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2018-10-15 13:00:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-15 13:00:05,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:05,250 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 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:00:05,250 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:05,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1579454859, now seen corresponding path program 59 times [2018-10-15 13:00:05,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12036 backedges. 0 proven. 12036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:09,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:09,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:09,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:09,808 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 121 states. [2018-10-15 13:00:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:17,803 INFO L93 Difference]: Finished difference Result 475 states and 476 transitions. [2018-10-15 13:00:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:17,803 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 443 [2018-10-15 13:00:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:17,805 INFO L225 Difference]: With dead ends: 475 [2018-10-15 13:00:17,805 INFO L226 Difference]: Without dead ends: 475 [2018-10-15 13:00:17,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-15 13:00:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 455. [2018-10-15 13:00:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-15 13:00:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-10-15 13:00:17,810 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 443 [2018-10-15 13:00:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:17,810 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-10-15 13:00:17,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-10-15 13:00:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-15 13:00:17,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:17,812 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 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:00:17,812 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:17,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1395374698, now seen corresponding path program 60 times [2018-10-15 13:00:17,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 12450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:22,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:22,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:22,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:22,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:22,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:22,592 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 123 states. [2018-10-15 13:00:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:30,707 INFO L93 Difference]: Finished difference Result 482 states and 483 transitions. [2018-10-15 13:00:30,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:30,708 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 450 [2018-10-15 13:00:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:30,711 INFO L225 Difference]: With dead ends: 482 [2018-10-15 13:00:30,711 INFO L226 Difference]: Without dead ends: 482 [2018-10-15 13:00:30,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-10-15 13:00:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 462. [2018-10-15 13:00:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-15 13:00:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 463 transitions. [2018-10-15 13:00:30,716 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 463 transitions. Word has length 450 [2018-10-15 13:00:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:30,716 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 463 transitions. [2018-10-15 13:00:30,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 463 transitions. [2018-10-15 13:00:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-15 13:00:30,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:30,718 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 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:00:30,718 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:30,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash 360644395, now seen corresponding path program 61 times [2018-10-15 13:00:30,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12871 backedges. 0 proven. 12871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:35,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:35,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:35,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:35,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:35,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:35,665 INFO L87 Difference]: Start difference. First operand 462 states and 463 transitions. Second operand 125 states. [2018-10-15 13:00:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:43,779 INFO L93 Difference]: Finished difference Result 489 states and 490 transitions. [2018-10-15 13:00:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:43,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 457 [2018-10-15 13:00:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:43,781 INFO L225 Difference]: With dead ends: 489 [2018-10-15 13:00:43,781 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 13:00:43,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 13:00:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 469. [2018-10-15 13:00:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-15 13:00:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 470 transitions. [2018-10-15 13:00:43,787 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 470 transitions. Word has length 457 [2018-10-15 13:00:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:43,787 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 470 transitions. [2018-10-15 13:00:43,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 470 transitions. [2018-10-15 13:00:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-15 13:00:43,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:43,789 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 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:00:43,789 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:43,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1458486282, now seen corresponding path program 62 times [2018-10-15 13:00:43,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13299 backedges. 0 proven. 13299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:48,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:48,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:48,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:48,799 INFO L87 Difference]: Start difference. First operand 469 states and 470 transitions. Second operand 127 states. [2018-10-15 13:00:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:57,612 INFO L93 Difference]: Finished difference Result 496 states and 497 transitions. [2018-10-15 13:00:57,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:00:57,613 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 464 [2018-10-15 13:00:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:57,614 INFO L225 Difference]: With dead ends: 496 [2018-10-15 13:00:57,614 INFO L226 Difference]: Without dead ends: 496 [2018-10-15 13:00:57,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-10-15 13:00:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 476. [2018-10-15 13:00:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-10-15 13:00:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 477 transitions. [2018-10-15 13:00:57,619 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 477 transitions. Word has length 464 [2018-10-15 13:00:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:57,620 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 477 transitions. [2018-10-15 13:00:57,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 477 transitions. [2018-10-15 13:00:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-15 13:00:57,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:57,622 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 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:00:57,622 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:57,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2092504267, now seen corresponding path program 63 times [2018-10-15 13:00:57,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13734 backedges. 0 proven. 13734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:02,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:01:02,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:01:02,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:01:02,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:01:02,832 INFO L87 Difference]: Start difference. First operand 476 states and 477 transitions. Second operand 129 states. [2018-10-15 13:01:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:12,068 INFO L93 Difference]: Finished difference Result 503 states and 504 transitions. [2018-10-15 13:01:12,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:01:12,068 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 471 [2018-10-15 13:01:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:12,070 INFO L225 Difference]: With dead ends: 503 [2018-10-15 13:01:12,070 INFO L226 Difference]: Without dead ends: 503 [2018-10-15 13:01:12,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:01:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-15 13:01:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 483. [2018-10-15 13:01:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-15 13:01:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 484 transitions. [2018-10-15 13:01:12,077 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 484 transitions. Word has length 471 [2018-10-15 13:01:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:12,077 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 484 transitions. [2018-10-15 13:01:12,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 484 transitions. [2018-10-15 13:01:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-15 13:01:12,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:12,080 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 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:01:12,080 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:12,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash -234775978, now seen corresponding path program 64 times [2018-10-15 13:01:12,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 14176 backedges. 0 proven. 14176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:17,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:17,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:17,287 INFO L87 Difference]: Start difference. First operand 483 states and 484 transitions. Second operand 131 states. [2018-10-15 13:01:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:26,898 INFO L93 Difference]: Finished difference Result 510 states and 511 transitions. [2018-10-15 13:01:26,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:26,898 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 478 [2018-10-15 13:01:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:26,900 INFO L225 Difference]: With dead ends: 510 [2018-10-15 13:01:26,900 INFO L226 Difference]: Without dead ends: 510 [2018-10-15 13:01:26,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-15 13:01:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 490. [2018-10-15 13:01:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-15 13:01:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 491 transitions. [2018-10-15 13:01:26,905 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 491 transitions. Word has length 478 [2018-10-15 13:01:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:26,905 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 491 transitions. [2018-10-15 13:01:26,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 491 transitions. [2018-10-15 13:01:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-15 13:01:26,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:26,907 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 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:01:26,908 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:26,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash -548613525, now seen corresponding path program 65 times [2018-10-15 13:01:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14625 backedges. 0 proven. 14625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:32,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:32,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:32,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:32,548 INFO L87 Difference]: Start difference. First operand 490 states and 491 transitions. Second operand 133 states. [2018-10-15 13:01:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:42,133 INFO L93 Difference]: Finished difference Result 517 states and 518 transitions. [2018-10-15 13:01:42,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:42,139 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 485 [2018-10-15 13:01:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:42,141 INFO L225 Difference]: With dead ends: 517 [2018-10-15 13:01:42,141 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 13:01:42,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 13:01:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 497. [2018-10-15 13:01:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-15 13:01:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-10-15 13:01:42,146 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 485 [2018-10-15 13:01:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:42,146 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-10-15 13:01:42,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-10-15 13:01:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 13:01:42,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:42,148 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 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:01:42,148 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:42,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:42,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1055606966, now seen corresponding path program 66 times [2018-10-15 13:01:42,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15081 backedges. 0 proven. 15081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:47,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:47,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:47,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:47,876 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 135 states. [2018-10-15 13:01:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:58,085 INFO L93 Difference]: Finished difference Result 524 states and 525 transitions. [2018-10-15 13:01:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:01:58,085 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 492 [2018-10-15 13:01:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:58,087 INFO L225 Difference]: With dead ends: 524 [2018-10-15 13:01:58,087 INFO L226 Difference]: Without dead ends: 524 [2018-10-15 13:01:58,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-15 13:01:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 504. [2018-10-15 13:01:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-15 13:01:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2018-10-15 13:01:58,092 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 492 [2018-10-15 13:01:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:58,093 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2018-10-15 13:01:58,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2018-10-15 13:01:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 13:01:58,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:58,095 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 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:01:58,095 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:58,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -348899317, now seen corresponding path program 67 times [2018-10-15 13:01:58,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15544 backedges. 0 proven. 15544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:03,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:03,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:02:03,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:02:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:02:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:02:03,981 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 137 states. [2018-10-15 13:02:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:14,213 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-10-15 13:02:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:02:14,214 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 499 [2018-10-15 13:02:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:14,216 INFO L225 Difference]: With dead ends: 531 [2018-10-15 13:02:14,216 INFO L226 Difference]: Without dead ends: 531 [2018-10-15 13:02:14,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:02:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-15 13:02:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 511. [2018-10-15 13:02:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-15 13:02:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-10-15 13:02:14,221 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 499 [2018-10-15 13:02:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:14,221 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-10-15 13:02:14,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-10-15 13:02:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-15 13:02:14,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:14,223 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 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:02:14,224 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:14,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash 345263894, now seen corresponding path program 68 times [2018-10-15 13:02:14,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16014 backedges. 0 proven. 16014 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:20,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:20,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:20,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:20,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:20,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:20,295 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 139 states. [2018-10-15 13:02:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:30,429 INFO L93 Difference]: Finished difference Result 538 states and 539 transitions. [2018-10-15 13:02:30,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:30,429 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 506 [2018-10-15 13:02:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:30,432 INFO L225 Difference]: With dead ends: 538 [2018-10-15 13:02:30,432 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 13:02:30,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 13:02:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 518. [2018-10-15 13:02:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-15 13:02:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 519 transitions. [2018-10-15 13:02:30,438 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 519 transitions. Word has length 506 [2018-10-15 13:02:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:30,438 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 519 transitions. [2018-10-15 13:02:30,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 519 transitions. [2018-10-15 13:02:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-10-15 13:02:30,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:30,441 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 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:02:30,441 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:30,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:30,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1357465003, now seen corresponding path program 69 times [2018-10-15 13:02:30,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16491 backedges. 0 proven. 16491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:36,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:36,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:36,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:36,588 INFO L87 Difference]: Start difference. First operand 518 states and 519 transitions. Second operand 141 states. [2018-10-15 13:02:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:47,748 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2018-10-15 13:02:47,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:47,748 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 513 [2018-10-15 13:02:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:47,750 INFO L225 Difference]: With dead ends: 545 [2018-10-15 13:02:47,750 INFO L226 Difference]: Without dead ends: 545 [2018-10-15 13:02:47,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-15 13:02:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 525. [2018-10-15 13:02:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-10-15 13:02:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 526 transitions. [2018-10-15 13:02:47,755 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 526 transitions. Word has length 513 [2018-10-15 13:02:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:47,755 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 526 transitions. [2018-10-15 13:02:47,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 526 transitions. [2018-10-15 13:02:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-15 13:02:47,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:47,758 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 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:02:47,758 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:47,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash 625126774, now seen corresponding path program 70 times [2018-10-15 13:02:47,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16975 backedges. 0 proven. 16975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:54,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:54,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:54,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:54,191 INFO L87 Difference]: Start difference. First operand 525 states and 526 transitions. Second operand 143 states. [2018-10-15 13:03:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:05,174 INFO L93 Difference]: Finished difference Result 552 states and 553 transitions. [2018-10-15 13:03:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:03:05,174 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 520 [2018-10-15 13:03:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:05,176 INFO L225 Difference]: With dead ends: 552 [2018-10-15 13:03:05,176 INFO L226 Difference]: Without dead ends: 552 [2018-10-15 13:03:05,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:03:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-15 13:03:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 532. [2018-10-15 13:03:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-10-15 13:03:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 533 transitions. [2018-10-15 13:03:05,182 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 533 transitions. Word has length 520 [2018-10-15 13:03:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:05,183 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 533 transitions. [2018-10-15 13:03:05,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:03:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 533 transitions. [2018-10-15 13:03:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 13:03:05,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:05,185 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 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:03:05,185 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:05,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:05,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1667627851, now seen corresponding path program 71 times [2018-10-15 13:03:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17466 backedges. 0 proven. 17466 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:11,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:11,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:03:11,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:03:11,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:03:11,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:11,553 INFO L87 Difference]: Start difference. First operand 532 states and 533 transitions. Second operand 145 states. [2018-10-15 13:03:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:23,389 INFO L93 Difference]: Finished difference Result 559 states and 560 transitions. [2018-10-15 13:03:23,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:03:23,390 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 527 [2018-10-15 13:03:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:23,392 INFO L225 Difference]: With dead ends: 559 [2018-10-15 13:03:23,392 INFO L226 Difference]: Without dead ends: 559 [2018-10-15 13:03:23,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:03:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-15 13:03:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 539. [2018-10-15 13:03:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 13:03:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 540 transitions. [2018-10-15 13:03:23,398 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 540 transitions. Word has length 527 [2018-10-15 13:03:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:23,399 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 540 transitions. [2018-10-15 13:03:23,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 540 transitions. [2018-10-15 13:03:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-15 13:03:23,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:23,401 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 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:03:23,401 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:23,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1329830954, now seen corresponding path program 72 times [2018-10-15 13:03:23,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17964 backedges. 0 proven. 17964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:30,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:30,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:30,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:30,036 INFO L87 Difference]: Start difference. First operand 539 states and 540 transitions. Second operand 147 states. [2018-10-15 13:03:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:41,703 INFO L93 Difference]: Finished difference Result 566 states and 567 transitions. [2018-10-15 13:03:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 13:03:41,703 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 534 [2018-10-15 13:03:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:41,705 INFO L225 Difference]: With dead ends: 566 [2018-10-15 13:03:41,705 INFO L226 Difference]: Without dead ends: 566 [2018-10-15 13:03:41,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:03:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-10-15 13:03:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 546. [2018-10-15 13:03:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-10-15 13:03:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 547 transitions. [2018-10-15 13:03:41,712 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 547 transitions. Word has length 534 [2018-10-15 13:03:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:41,713 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 547 transitions. [2018-10-15 13:03:41,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 547 transitions. [2018-10-15 13:03:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-15 13:03:41,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:41,715 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 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:03:41,715 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:41,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1205577493, now seen corresponding path program 73 times [2018-10-15 13:03:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat